We show that Nash equilibrium components are universal for the collection of connected polyhedral sets. More precisely for every polyhedral set we construct a so-called binary game—a game where all players have two pure strategies and a common utility function with values either zero or...

Brown and von Neumann introduced a dynamical system that converges to saddle points of zero sum games with finitely many strategies. Nash used the mapping underlying these dynamics to prove existence of equilibria in general games. The resulting Brown-von Neumann-Nash dynamics are a benchmark...

We study the evolution of preferences under perfect and almost perfect observability in symmetric 2-player games. We demonstrate that if nature can choose from a sufficiently general preference space, which includes preferences over outcomes that may depend on the opponent's preference-type,...

A stochastic myopic best-reply dynamics is said to have property (W), for a given number of players n, if every pure weakly dominated strategy in every n-player game is eliminated in the long-run distribution of play induced by the dynamics. In this paper I give a necessary and sufficient...