Egalitarianism and Efficiency in Repeated Symmetric Games

We analyze the symmetric equilibria of repeated symmetric games where there is a conflict of interests over equilibria—the battle-of-the-sexes or the hawk–dove game are key examples. If one restricts attention to symmetric equilibria, efficient equilibria must be egalitarian. For finitely repeated games, and generic discount factors, there is a unique outcome path which ensures efficiency within the class of symmetric equilibria. This is also true for the infinitely repeated games if the players are sufficiently impatient. Journal of Economic Literature Classification Numbers: C72, C73.     

Robust equilibria under non-common priors

This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogeneous priors. An equilibrium of a complete information game is robust to incomplete information under non-common priors if for every incomplete information game where each player's prior assigns high probability on the event that the players know at arbitrarily high order that the payoffs are given by the complete information game, there exists a Bayesian Nash equilibrium that generates behavior close to the equilibrium in consideration. It is shown that for generic games, an equilibrium is robust under non-common priors if and only if it is the unique rationalizable action profile. Set-valued concepts are also introduced, and for generic games, a smallest robust set is shown to exist and coincide with the set of a posteriori equilibria.     

Commitment Robust Equilibria and Endogenous Timing

This paper investigates which equilibria of a game are still viable when players have the opportunity to commit themselves. To that end we study a model of endogenous timing in which players face the trade-off between committing early and moving late. It is shown that mixed (resp. pure) equilibria of the original game are subgame perfect (resp. persistent) in the timing game only when no player has an incentive to move first. Consequently, mixed equilibria are viable only if no player has an incentive to move first. One needs strong evolutionary solution concepts to draw that conclusion for pure equilibria.Journal of Economic LiteratureClassification Number: C72.     

Screening in a Matching Market

Contract design under incomplete information is often analysed in a bilaterally monopolistic setting. If the informed party's reservation value does not depend on its private information (its type), it is a standard result that the uninformed side offers "low" types distorted contracts to reduce the information rent left to "high7rdquo; types.
We challenge this result by embedding contract design in a matching market environment. We consider a market where players meet pairwise and where, in each match, either side may be chosen to make a take-it-or-leave-it offer. As frictions become sufficiently low, we find that the set of equilibria is independent of whether there is complete or incomplete information. In particular, all contracts are free of distortions.     

Essential equilibria of large generalized games

We characterize the essential stability of games with a continuum of players, where strategy profiles may affect objective functions and admissible strategies. Taking into account the perturbations defined by a continuous mapping from a complete metric space of parameters to the space of continuous games, we prove that essential stability is a generic property and every game has a stable subset of equilibria. These results are extended to discontinuous large generalized games assuming that only payoff functions are subject to perturbations. We apply our results in an electoral game with a continuum of Cournot-Nash equilibria, where the unique essential equilibrium is that only politically engaged players participate in the electoral process. In addition, employing our results for discontinuous games, we determine the stability properties of competitive prices in large economies.     

The Envelope Theorem and Comparative Statics of Nash Equilibria

The Envelope Theorem for Nash equilibria shows that the strategic reaction of the other players in the game is important for determining how parameter perturbations affect a given player's indirect objective function. The fundamental comparative statics matrix of Nash equilibria for theithplayer in anN-player static game includes the equilibrium response of the otherN−1players in the game to the parameter perturbation and is symmetric positive semidefinite subject to constraint. This result is fundamental in that it holds for all sufficiently smooth Nash equilibria and is independent of any curvature or stability assumptions imposed on the game.Journal of Economic LiteratureClassification Numbers: C72, C61.     

Cycling in a stochastic learning algorithm for normal form games

In this paper we study a stochastic learning model for 2×2 normal form games that are played repeatedly. The main emphasis is put on the emergence of cycles. We assume that the players have neither information about the payoff matrix of their opponent nor about their own. At every round each player can only observe his or her action and the payoff he or she receives. We prove that the learning algorithm, which is modeled by an urn scheme proposed by Arthur (1993), leads with positive probability to a cycling of strategy profiles if the game has a mixed Nash equilibrium. In case there are strict Nash equilibria, the learning process converges a.s. to the set of Nash equilibria.     

Income distribution and equilibrium multiplicity in a stigma-based model of tax evasion

This paper incorporates continuous income distribution into the stigma-based model of tax compliance. The paper investigates the effect of income distribution on the existence of multiple equilibria, and characterizes the conditions under which multiple equilibria emerge. Precisely, multiple equilibria exist if taxpayer incomes are sufficiently homogeneous, because the ‘social coordination effect’ dominates the ‘individual characteristics effect’. Numerical simulations show that the main proposition is robust to allowing two-step audit policies on the part of the tax agency, under the presumption that the best (or good) equilibrium is selected whenever there are multiple equilibria. As a byproduct, the effect of various forms of tax reforms on the optimal two-step audit policy, the equilibrium compliance, and fiscal revenue is analyzed.     

Participation constraints of matching mechanisms

Matching mechanisms have been proposed to improve public good provision in voluntary contributions. However, such decentralized subsidizing mechanisms may not be Pareto‐improving and may suffer from incomplete information and incredible commitment. This paper examines participation constraints of matching mechanisms with small matching rates in two cases of equilibria. At interior equilibria, there always exist small Pareto‐improving matching schemes regardless of preferences. This universal existence is useful for cooperation among heterogeneous players in the context without global information of preferences or at the international level without central governments. At corner equilibria, matching schemes work in different ways and have distinct welfare effects in certain cases, and the existence of Pareto‐improving matching schemes is not universal but is possible under certain conditions. The paper further characterizes Pareto‐improving matching schemes, and shows that it is easier to reach Pareto‐improving matching outcomes if players value more on public goods and have stronger substitution between private and public goods.     

Multi-activity contests

In many contests, players can influence their chances of winning through multiple activities or “arms”. We develop a model of multi-armed contests and axiomatize its contest success function. We then analyze the outcomes of the multi-armed contest and the effects of allowing or restricting arms. Restricting an arm increases total effort directed to other arms if and only if restricting the arm balances the contest. Restricting an arm tends to reduce rent dissipation because it reduces the discriminatory power of the contest. But it also tends to increase rent dissipation if it balances the contest. Less rent is dissipated if an arm is restricted as long as no player is excessively stronger than the other with that arm. If players are sufficiently symmetric in an arm, both players are better off if that arm is restricted. Nevertheless, players cannot agree to restrict the arm if their costs of using the arm are sufficiently low.     

Participation and the provision of discrete public goods: a strategic analysis

This paper considers the Nash equilibria to a game where a discrete public good is to be provided. Each individual may participate by making a fixed contribution. If a sufficient number of contributions are made, the good is provided. Otherwise, the good is not provided. One variant of the rules allows for contributions to be refunded when the good is not provided. For pure strategies, we find that the Nash equilibria with a refund are a superset of those without a refund. For both rules, the efficient number of players contributing is an equilibrium. For mixed strategies, to every equilibrium without a refund there is a corresponding equilibrium with a refund with a higher number of expected contributors. Mixed strategy equilibria ‘disappear’ as the number of players grows large. Some results reported in the experimental literature are discussed in light of these theoretical results.     

Congestion games with malicious players

We study the equilibria of non-atomic congestion games in which there are two types of players: rational players, who seek to minimize their own delay, and malicious players, who seek to maximize the average delay experienced by the rational players. We study the existence of pure and mixed Nash equilibria for these games, and we seek to quantify the impact of the malicious players on the equilibrium. One counterintuitive phenomenon which we demonstrate is the “windfall of malice”: paradoxically, when a myopically malicious player gains control of a fraction of the flow, the new equilibrium may be more favorable for the remaining rational players than the previous equilibrium.     

Learning to alternate

The Individual Evolutionary Learning (IEL) model explains human subjects’ behavior in a wide range of repeated games which have unique Nash equilibria. Using a variation of ‘better response’ strategies, IEL agents quickly learn to play Nash equilibrium strategies and their dynamic behavior is like that of humans subjects. In this paper we study whether IEL can also explain behavior in games with gains from coordination. We focus on the simplest such game: the 2 person repeated Battle of Sexes game. In laboratory experiments, two patterns of behavior often emerge: players either converge rapidly to one of the stage game Nash equilibria and stay there or learn to coordinate their actions and alternate between the two Nash equilibria every other round. We show that IEL explains this behavior if the human subjects are truly in the dark and do not know or believe they know their opponent’s payoffs. To explain the behavior when agents are not in the dark, we need to modify the basic IEL model and allow some agents to begin with a good idea about how to play. We show that if the proportion of inspired agents with good ideas is chosen judiciously, the behavior of IEL agents looks remarkably similar to that of human subjects in laboratory experiments.     

Heterogeneous network games: Conflicting preferences

In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players endowed with an idiosyncratic identity interact on a social network through strategic complements or substitutes. We classify the possible types of Nash equilibria under complete information, finding two thresholds for switching action that relate to the two-player setup of the games. This structure of equilibria is considerably reduced when turning to incomplete information, in a setup in which players only know the distribution of the number of neighbors of the network. For high degrees of heterogeneity in the population the equilibria is such that every player can choose her preferred action, whereas if one of the identities is in the minority frustration ensues.     

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.     

Beliefs and Public Good Provision with Anonymous Contributors

We analyze a static game of public good contributions where finitely many anonymous players have heterogeneous preferences about the public good and heterogeneous beliefs about the distribution of preferences. In the unique symmetric equilibrium, the only individuals who make positive contributions are those who most value the public good and who are also the most pessimistic; that is, according to their beliefs, the proportion of players who most like the public good is smaller than it would be according to any other possible belief. We predict whether the aggregate contribution is larger or smaller than it would be in an analogous game with complete information and heterogeneous preferences, by comparing the beliefs of contributors with the true distribution of preferences. A trade‐off between preferences and beliefs arises if there is no individual who simultaneously has the highest preference type and the most pessimistic belief. In this case, there is a symmetric equilibrium, and multiple symmetric equilibria occur only if there are more than two preference types.     

Random-player games

This paper introduces general games with incomplete information in which the number, as well as the types or identities, of the participating players are determined by chance and might not be known to the players when they make their choices of actions. In these games, the selection of the number and types of players is modeled as a finite point process on a suitable type space. Definitions of pure-strategy, mixed-strategy, and correlated equilibria in random-player games are given, extending the corresponding ones for finite games, Bayesian games, and games with population uncertainty, which may all be considered as special cases of random-player games.     

Bilateral commitment

We consider non-cooperative environments in which two players have the power to gradually and unilaterally rule out some of their actions. Formally, we embed a strategic-form game into a multi-stage game, in which players can restrict their action spaces in all but the final stage, and select among the remaining actions in the last stage. We say that an action profile is implementable by commitment if this action profile is played in the last stage of a subgame-perfect equilibrium path. We provide a complete characterization of all implementable action profiles and a simple method to find them. It turns out that the set of implementable profiles does not depend on the length of the commitment process. We show, furthermore, that commitments can have social value in the sense that in some games there are implementable action profiles that dominate all Nash equilibria of the original game.     

Coordination and the Provision of Discrete Public Goods by Correlated Equilibria

The strategic analysis of the private provision of a discrete public good has shown the existence of multiple Nash equilibria with the efficient number of players voluntarily contributing. However the coordination issue is left unexplained by this literature. The experimental evidence shows that communication among players is helpful in achieving cooperation. We claim that, from the theoretical point of view, this is equivalent to playing correlated equilibria in an extended public good game with communication, modeled as Chicken. We characterize such equilibria as feasible coordination mechanisms to achieve public goods provision in the general contribution game. We further introduce a second kind of game characterized by payoff externalities that may persist after the minimal threshold of contributors is achieved. While it is easy to show the existence of Pareto efficient correlated equilibria in the first game, in the second one players face incentive problems such that a first best cannot always be an equilibrium. Nevertheless there exist correlated equilibria that can qualify as incentive efficient mechanisms, once free riding is seen as a moral hazard issue. Finally, with an example, we discuss the impact of coalition formation in our framework.     

On ‘Informationally Robust Equilibria’ for Bimatrix Games

Informationally robust equilibria (IRE) are introduced in Robson (Games Econ Behav 7: 233–245, 1994) as a refinement of Nash equilibria for strategic games. Such equilibria are limits of a sequence of (subgame perfect) Nash equilibria in perturbed games where with small probability information about the strategic behavior is revealed to other players (information leakage). Focusing on bimatrix games, we consider a type of informationally robust equilibria and derive a number of properties they form a non-empty and closed subset of the Nash equilibria. Moreover, IRE is a strict concept in the sense that the IRE are independent of the exact sequence of probabilities with which information is leaked. The set of IRE, like the set of Nash equilibria, is the finite union of polytopes. In potential games, there is an IRE in pure strategies. In zero-sum games, the set of IRE has a product structure and its elements can be computed efficiently by using linear programming. We also discuss extensions to games with infinite strategy spaces and more than two players. The authors would like to thank Marieke Quant for her helpful comments.