We observe that a symmetric two-player zero-sum game has a pure strategy equilibrium if and only if it is not a generalized rock-paper-scissors matrix. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure equilibrium. Further sufficient conditions for...

In this paper, the author reviews some real-world examples of costly and protracted wars of attrition and describes the current debate over Puerto Rico’s constitutional status as a “legislative war of attrition.” In addition, the author presents a two-player as well as an n-player...

We use experiments to analyze what type of communication is most effective in achieving cooperation in a simple collusion game. Consistent with the existing literature on communication and collusion, even minimal communication leads to a short run increase in collusion. However, in a limited...

We study perfect information games with an infinite horizon played by an arbitrary number of players. This class of games includes infinitely repeated perfect information games, repeated games with asynchronous moves, games with long and short run players, games with overlapping generations of...

We test infinitely repeated prisoner's dilemma games with random continuation in the laboratory to capture the effect of strategic risk on co-operation. We propose a criterion building on Harsanyi and Selten's (1988) risk dominance concept and motivate it by three heuristic principles. Our...

Game theorists typically assume that changing a game's payoff levels - by adding the same constant to, or subtracting it from, all payoffs - should not affect behavior. While this invariance is an implication of the theory when payoffs mirror expected utilities, it is an empirical question when...

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

Delayed perfect monitoring in an infinitely repeated discounted game is modelled by allocating the players to a connected and undirected network. Players observe their immediate neighbors' behavior only, but communicate over time the repeated game's history truthfully throughout the network. The...

We consider an auction environment with interdependent values. Each bidder can learn her payoff type through costly information acquisition. We contrast the socially optimal decision to acquire information with the equilibrium solution in which each agent has to privately bear the cost of...

Belief models capable of detecting 2- to 5-period patterns in repeated games by matching the current historical context to similar realizations of past play are presented. The models are implemented in a cognitive framework, ACT-R, and vary in how they implement similarity-based categorization...