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...

Experimental and observational studies have highlighted the importance of agents being conditionally cooperative when facing a social dilemma. We formalize this mechanism in a theoretical model that portrays a small community having joint access to a common pool resource. The diffusion of norms...

Agent-based models typically involve large numbers of interacting individuals with widely differing characteristics, rules of behavior, and sources of information. The dynamics of such systems can be extremely complex due to their high dimensionality. This chapter discusses a general method for...

Many conditions have been introduced to weaken the continuity re-quirements for equilibrium existence in games. We introduce a new con-dition, called regularity, that is simple and easy to verify. It is implied both by Reny's better-reply security and Simon and Zame's endogenous sharing rule...

We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

We demonstrate that in simple 2 X 2 games (cumulative) prospect theory preferences can be evolutionarily stable, i.e. a population of players with prospect theory preferences can not be invaded by more rational players. This holds also if probability weighting is applied to the probabilities of...

This paper studies the evolutionary stability of the unique Nash equilibrium of a first price sealed bid auction. It is shown that the Nash equilibrium is not asymptotically stable under payoff monotonic dynamics for arbitrary initial populations. In contrast, when the initial population...

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....