On the folk theorem with one-dimensional payoffs and different discount factors

Proving the folk theorem in a game with three or more players usually requires imposing restrictions on the dimensionality of the stage-game payoffs. Fudenberg and Maskin (1986) assume full dimensionality of payoffs, while Abreu et al. (1994) assume the weaker NEU condition (“nonequivalent utilities”). In this note, we consider a class of n-player games where each player receives the same stage-game payoff, either zero or one. The stage-game payoffs therefore constitute a one-dimensional set, violating NEU. We show that if all players have different discount factors, then for discount factors sufficiently close to one, any strictly individually rational payoff profile can be obtained as the outcome of a subgame-perfect equilibrium with public correlation.     

Program equilibrium

In a computerized setting, players' strategies can be implemented by computer programs, to be executed on a shared computational devise. This situation becomes typical to new Internet economies, where agent technologies play a major role. This allows the definition of a program equilibrium. Following the fundamental ideas introduced by von Neumann in the 1940s (in parallel to his seminal contribution to game theory), a computer program can be used both as a set of instructions, as well as a file that can be read and compared with other files. We show that this idea implies that in a program equilibrium of the one-shot prisoners dilemma mutual cooperation is obtained. More generally, we show that the set of program equilibrium payoffs of a game coincides with the set of feasible and individually rational payoffs of it.     

Stochastic evolutionary selection in finite populations

We primarily focus on a wide range of stochastic evolutionary game dynamics between two strategies which are characterized by a condition we call monotonicity: the sign of the difference between the probabilities of increasing and decreasing an A-individual completely depends on the difference of payoffs based on different strategies. When mutations are excluded, we provide sufficient conditions for selection to favor one strategy over the other and necessary conditions for selection to favor or oppose change, respectively. Moreover, we discuss which strategy will be favored in case of rare mutations and give a simple rule to determine evolutionary selection of strategies for large populations under some specific stochastic mutation–selection dynamics.     

Large deviations and multinomial probit choice

We consider a discrete choice model in which the payoffs to each of an agent?s n actions are subjected to the average of m i.i.d. shocks, and use tools from large deviations theory to characterize the rate of decay of the probability of choosing a given suboptimal action as m approaches infinity. Our model includes the multinomial probit model of Myatt and Wallace (2003) [5] as a special case. We show that their formula describing the rates of decay of choice probabilities is incorrect, provide the correct formula, and use our large deviations analysis to provide intuition for the difference between the two.     

Decompositions and potentials for normal form games

A basic model of commitment is to convert a two-player game in strategic form to a “leadership game” with the same payoffs, where one player, the leader, commits to a strategy, to which the second player always chooses a best reply. This paper studies such leadership games for games with convex strategy sets. We apply them to mixed extensions of finite games, which we analyze completely, including nongeneric games. The main result is that leadership is advantageous in the sense that, as a set, the leader's payoffs in equilibrium are at least as high as his Nash and correlated equilibrium payoffs in the simultaneous game. We also consider leadership games with three or more players, where most conclusions no longer hold.     

Learning from private information in noisy repeated games

We study the perfect type-contingently public ex-post equilibrium (PTXE) of repeated games where players observe imperfect public signals of the actions played, and both the payoff functions and the map from actions to signal distributions depend on an unknown state. The PTXE payoffs when players are patient are determined by the solutions to a family of linear programming problems. Using this characterization, we develop conditions under which play can be as if the players have learned the state. We provide a sufficient condition for the folk theorem, and a characterization of the PTXE payoffs in games with a known monitoring structure.     

Unmediated communication in games with complete and incomplete information

We study the effects of adding unmediated communication to static, finite games of complete and incomplete information. We characterize S^U(G), the set of outcomes of a game G, that are induced by sequential equilibria of cheap talk extensions. A cheap talk extension of G is an extensive-form game in which players communicate before playing G. A reliable mediator is not available and players exchange private or public messages that do not affect directly their payoffs. We first show that if G is a game of complete information with five or more players and rational parameters, then S^U(G) coincides with the set of correlated equilibria of G. Next, we demonstrate that if G is a game of incomplete information with at least five players, rational parameters and full support (i.e., all profiles of types have positive probability), then S^U(G) is equal to the set of communication equilibria of G.     

Finitely Many Players with Bounded Recall in Infinitely Repeated Games

We study the set of limit points of equilibrium payoffs in n-player repeated games, with bounded recall, when the memory capacities of all the players grow to infinity. Two main issues are explored: (i) whether differential information enables players to play correlatively, and (ii) the extent to which boundedly rational players can learn others′ behavior patterns and conceal their own. Journal of Economic Literature Classification Number: 026.     

Stochastic imitation in finite games

In this paper we model an evolutionary process with perpetual random shocks, where individuals sample population-specific strategy-payoff pairs and imitate the most successful behavior. For finite n-player games we prove that in the limit, as the perturbations tend to zero, only strategy-tuples in minimal sets closed under single better replies will be played with positive probability. If the strategy-tuples in one such minimal set have strictly higher payoffs than all outside strategy-tuples, then the strategy-tuples in this set will be played with probability one in the limit, provided the minimal set is a product set and the sample is sufficiently large.     

Evolutionary selection of ‘chivalrous’ conventions in coordination games without common expectations

We study an evolutionary game-theoretic model where players have to choose within a predetermined set of mixed strategies in a coordination game. Players are of two different kinds, male and female. No common expectations assumption is made; players tend therefore to adopt the strategy that yields larger than average expected payoffs for their kind. In this framework, every stable stationary point of the population dynamics can be interpreted as the emergence of a particular convention. A classification of the possible conventions is provided; conditions for their emergence are determined.     

Renegotiation in Repeated Games with Side-Payments

We consider repeated games with side-payments: players have an endowment of wealth in each period in which transfers can be made. We show that if endowments are large enough and the common discount factor high enough, then a strongly renegotiation–proof equilibrium (SRP) in the sense of Farrell and Maskin exists. As the discount factor goes to 1, the set of SRP payoffs converges to the set of efficient, individually rational payoffs. These results provide a justification for the efficiency principle when agreements are not enforceable. Journal of Economic Literature Classification Numbers: C73, D23, L14.     

Communication in Repeated Games with Private Monitoring

The paper considers repeated games where each player can be observed by only a subset of the other players, and where players can make public announcements about the behavior of the players they observed. We address the following question: What is the minimal level of observability that is required to obtain efficient outcomes? The main result is that the limit set of sequential equilibrium payoffs, when the discount factor tends to one, contains the set of individual rational payoffs whenever each player is observed by at leasttwoother players.Journal of Economic LiteratureClassification Number: C73.     

Choquet Rationality

Consider a decision problem under uncertainty for a decision maker with known (utility) payoffs over prizes. We say that an act is Choquet (Shafer, Bernoulli) rational if for some capacity (belief function, probability) over the set of states, it maximizes her “expected” utility. We show that an act may be Choquet rational without being Bernoulli rational, but it is Choquet rational if and only if it is Shafer rational. Journal of Economic Literature Classification Numbers: C72, D81.     

Choosing and sharing

Implementing a project, like a nationwide nuclear waste disposal, which benefits all involved agents but brings major costs only to the host is often problematic. In practice, revelation issues and redistributional concerns are significant obstacles to achieving stable agreements. We address these issues by proposing the first mechanism to select the efficient site (the host with the lowest cost) while simultaneously allowing for the implementation of any individually rational division of the whole hosting cost. The subgame perfect Nash equilibria of our simple mechanism are efficient, budget-balanced and individually rational. Moreover, the truthful equilibrium is immune to coalitional deviations.     

Economies with Land—A Game Theoretical Approach

With an economy with land (an economy of Debreu-type in which land is the unique commodity) we associate a cooperative game with transferable utility v . The set of all TU-games of type v is investigated and the set of equilibrium payoffs (in the TU-sense) of the economy is described as a subset of the core of v . We prove that equilibrium payoffs can be extended to population monotonic allocation schemes in the sense of Sprumont.     

A resolution of N-person prisoners' dilemma

Summary. The purpose of this paper is to show that cooperation is possible in N-person prisoners' dilemma if players have incomplete information on the order of their moves. We consider a modified version of N-person prisoners' dilemma in which players sequentially move in the order determined by Nature, and during the play they get some information about others. We provide an information partition and a condition of payoffs for which cooperation is attained in an equilibrium. Further, for the case that full cooperation is not attained, we examine the largest partial cooperation which is achieved in an equilibrium. Received: March 5, 1995; revised version August 11, 1996     

Repeated games with present-biased preferences

We study infinitely repeated games with perfect monitoring, where players have β-δ preferences. We compute the continuation payoff set using recursive techniques and then characterize equilibrium payoffs. We then explore the cost of the present-time bias, producing comparative statics. Unless the minimax outcome is a Nash equilibrium of the stage game, the equilibrium payoff set is not monotonic in β or δ. Finally, we show how the equilibrium payoff set is contained in that of a repeated game with smaller discount factor.     

Repeated games with one-memory

We study the extent to which equilibrium payoffs of discounted repeated games can be obtained by 1-memory strategies. We establish the following in games with perfect (rich) action spaces: First, when the players are sufficiently patient, the subgame perfect Folk Theorem holds with 1-memory. Second, for arbitrary level of discounting, all strictly enforceable subgame perfect equilibrium payoffs can be approximately supported with 1-memory if the number of players exceeds two. Furthermore, in this case all subgame perfect equilibrium payoffs can be approximately supported by an ε-equilibrium with 1-memory. In two-player games, the same set of results hold if an additional restriction is assumed: Players must have common punishments. Finally, to illustrate the role of our assumptions, we present robust examples of games in which there is a subgame perfect equilibrium payoff profile that cannot be obtained with 1-memory. Thus, our results are the best that can be hoped for.