It is a very well-known result that in terms of evolutionary stability the long-run outcome of a Cournot oligopoly market with finitely many firms approaches the perfectly competitive Walrasian market outcome (Vega-Redondo, 1997). However, in this paper we show that an asymmetric structure in...

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

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

In a coordination game such as the Battle of the Sexes, agents can condition their plays on external signals that can, in theory, lead to a Correlated Equilibrium that can improve the overall payoffs of the agents. Here we explore whether boundedly rational, adaptive agents can learn to...

The alternating offers game due to Rubinstein (1982) had been used by Binmore (1980) and by Binmore et.al. (1986) to provide via its unique subgame perfect equilibrium an approximate non-cooperative support for the Nash bargaining solution of associated cooperative two-person bargaining games....

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

The Nash bargaining solution of a modified bargaining problem in the contract space yields the pair of stationary subgame perfect equilibrium proposals in the alternating offers model, also for positive time between proposals. As time vanishes, convergence to the Nash bargaining solution is...

The bargaining model with stochastic order of proposing players is properly embedded in continuous time and it is strategically equivalent to the alternating offers model. For all parameter values, the pair of equilibrium proposals corresponds to the Nash bargaining solution of a modified...

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