We propose a meta-heuristic approach for solving nonlinear dynamic tracking games. In contrast to more "traditional" methods based on linear-quadratic (LQ) techniques, this derivative-free method is very flexible (e.g. to introduce inequality constraints). The meta-heuristic is applied to a...

We study how the framework of classical game theory changes when the preferences of the players are described by Prospect Theory instead of Expected Utility Theory. Specifically, we study the influence of framing effect and probability weighting on the existence and specific structure of Nash...

We report experiments designed to test between Nash equilibria that are stable and unstable under learning. The “TASP” (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes....

This paper yields sufficient conditions for Pareto inoptimality of controls forming Nash equilibria in differential games. In Appendix a result on existence of open loop Nash equilibria is added. -- Differential games ; Nash equilibria ; Pareto improvements.

Intuitively, we expect that players who are allowed to engage in costless communication before playing a game would be foolish to agree on an inefficient equilibrium. At the same time, however, such preplay communication has been suggested as a rationale for expecting Nash equilibrium in...

It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a...

For games in which there is no evolutionarily stable strategy, it can be useful to look for neutrally stable ones. In extensive form games for instance there is typically no evolutionary stable strategy, while there may very well be a neutrally stable one. Such strategies can however still be...

Many economic problems can be formulated as dynamic games in which strategically interacting agents choose actions that determine the current and future levels of a single capital stock. We study necessary conditions that allow us to characterize Markov perfect Nash equilibria (MPNE) for these...

We prove that, in all finite generic extensive-form games of perfect information, a continuous-time best response dynamic always converges to a Nash equilibrium component. We show the robustness of convergence by an approximate best response dynamic: whatever the initial state and an allowed...

We consider a basic stochastic evolutionary model with rare mutation and a best-reply (or better-reply) selection mechanism. Following Young's papers, we call a state stochastically stable if its long-term relative frequency of occurrence is bounded away from zero as the mutation rate decreases...