We show that a set of outcomes outside the convex hull of Nash equilibria can be asymptotically stable with respect to convex monotonic evolutionary dynamics. Boundedly rational agents receive signals and condition the choice of strategies on the signals. A set of conditional strategies is...

It is commonly assumed that friendship should decrease strategic uncertainty in games involving tacit coordination. However, this has never been tested on two "opposite poles" of coordination, namely, games of strategic complements and substitutes. We present an experimental study having...

It is commonly assumed that friendship should generally benefit agents' ability to tacitly coordinate with others. However, this has never been tested on two "opposite poles" of coordination, namely, games of strategic complements and substitutes. We present an experimental study in which...

Friendship is commonly assumed to reduce strategic uncertainty and enhance tacit coordination. However, this assumption has never been tested across two opposite poles of coordination involving either strategic complementarity or substitutability. We had participants interact with friends or...

In this paper we consider the linear quadratic differential game for descriptor systems that have index one. We derive both necessary and sufficient conditions for existence of an open-loop Nash equilibrium

This note analyzes in a fishery management problem the effects of relaxing one of the usual assumptions in the literature of dynamic games. Specifically, the assumption that players restrict to strategies that stabilize the system. Previous works in the literature have shown that feedback Nash...

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

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

This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements. Homotopies are also suitable to compute equilibria that are selected by various selection theories. We present all...