Motivated by issues of imitation, learning and evolution, we introduce a framework of non-co-operative games, allowing both countable sets of pure actions and player types and player types and demonstrate that for all games with sufficiently many players, every mixed strategy Nash equilibrium...

In this note we study a very simple trial & error learning process in the context of a Cournot oligopoly. Without any knowledge of the payoff functions players increase, respectively decrease, their quantity by one unit as long as this leads to higher profits. We show that despite the absence of...

We model a bipartite network in which links connect agents with public goods. Agents play a voluntary contribution game in which they decide how much to contribute to each public good they are connected to. We show that the problem of finding a Nash equilibrium can be posed as a non-linear...

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

This paper analyzes the effect of the availability of information about the payoff structure on the behavior of players in a Common-Pool Resource game. Six groups of six individuals played a complete information game, while other six groups played the same game but with no information about the...

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