This paper brings together analyses of two-way flow Strict Nash networks under exclusive player heterogeneity assumption and exclusive partner heterogeneity assumption. This is achieved through examining how the interactions between these two assumptions influence important properties of Strict...

We propose a novel method to find Nash equilibria in games with binary decision variables by including compensation payments and incentive-compatibility constraints from non-cooperative game theory directly into an optimization framework in lieu of using first order conditions of a...

Using data from an experiment by Forsythe, Myerson, Rietz, and Weber (1993), designed for a different purpose, we test the "standard theory" that players have preferences only over their own mentary payoffs and that play will be in (evolutionary stable) equilibrium. In the experiment each...

Since the seminal paper of Nash (1950) game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. We study the properties of these strategies in 2-player non-zero-sum strategic games, whose Nash equilibria are only mixed.

We explore in an equilibrium framework whether games with multiple Nash equilibria are easier to play when players can communicate. We consider two variants, modelling talk about future plans and talk about past actions. The language from which messages are chosen is endogenous, messages are...

This paper studies network formation in settings where players are heterogeneous with respect to benefits as well as the costs of forming links. Our results demonstrate that centrality, center-sponsorship and short network diameter are robust features of equilibrium networks. We find that in a...

Perfect information games have a particularly simple structure of equilibria in the associated normal form. For generic such games each of the finitely many connected components of Nash equilibria is contractible. For every perfect information game there is a unique connected and contractible...

Despite their importance, games with incomplete information and dependent types are poorly understood; only special cases have been considered and a general approach is not yet available. In this paper, we propose a new condition (named richness) for correlation of types in (asymmetric) Bayesian...

We analyze subjects' eye movements while they make decisions in a series of one-shot games. The majority of them perform a partial and selective analysis of the payoff matrix, often ignoring the payoffs of the opponent and/or paying attention only to specific cells. Our results suggest that...

A strategy profile of a game is called robustly stochastically stable if it is stochastically stable for a given behavioral model independently of the specification of revision opportunities and tie-breaking assumptions in the dynamics. We provide a simple radius-coradius result for robust...