Co-ordination, Spillovers, and Cheap Talk

We analyze the role of cheap-talk in two player games with one-sided incomplete information. We identify conditions under which (1) players can fully communicate and coordinate on efficient Nash equilibria of the underlying complete information game; and (2) players cannot communicate so cheap-talk does not alter the equilibrium set of the Bayesian game. We present examples that illustrate several issues that arise when there is two-sided incomplete information. Journal of Economic Literature Classification Numbers: C72, D82.     

Simple search methods for finding a Nash equilibrium

We present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2-player games and one for n-player games. Both algorithms bias the search towards supports that are small and balanced, and employ a backtracking procedure to efficiently explore these supports. Making use of a new comprehensive testbed, we test these algorithms on many classes of games, and show that they perform well against the state of the art—the Lemke–Howson algorithm for 2-player games, and Simplicial Subdivision and Govindan–Wilson for n-player games.     

Nash equilibrium in games with incomplete preferences

Summary. This paper investigates Nash equilibrium under the possibility that preferences may be incomplete. I characterize the Nash-equilibrium-set of such a game as the union of the Nash-equilibrium-sets of certain derived games with complete preferences. These games with complete preferences can be derived from the original game by a simple linear procedure, provided that preferences admit a concave vector-representation. These theorems extend some results on finite games by Shapley and Aumann. The applicability of the theoretical results is illustrated with examples from oligopolistic theory, where firms are modelled to aim at maximizing both profits and sales (and thus have multiple objectives). Mixed strategy and trembling hand perfect equilibria are also discussed.Received: 22 September 2003, Revised: 24 June 2004, JEL Classification Numbers: D11, C72, D43.I would like to thank Jean-Pierre Benôit, Juan Dubra, Alejandrio Jofre, Debraj Ray, Kim-Sau Chung and the seminar participants at NYU and at the Universidad de Chile for their comments. I am most grateful to Efe Ok, for his comments, criticism, suggestions and questions.     

A theory of cooperation in games with an application to market socialism

Abstract

Economic theory has focused almost exclusively on how humans compete with each other in their economic activity, culminating in general equilibrium (Walras–Arrow–Debreu) and game theory (Cournot–Nash). Cooperation in economic activity is, however, important, and is virtually ignored. Because our models influence our view of the world, this theoretical lacuna biases economists’ interpretation of economic behavior. Here, I propose models that provide micro-foundations for how cooperation is decentralized by economic agents. It is incorrect, in particular, to view competition as decentralized and cooperation as organized only by central diktat. My approach is not to alter preferences, which is the strategy behavioral economists have adopted to model cooperation, but rather to alter the way that agents optimize. Whereas Nash optimizers view other players in the game as part of the environment (parameters), Kantian optimizers view them as part of action. When formalized, this approach resolves the two major failures of Nash optimization from a welfare viewpoint – the Pareto inefficiency of equilibria in common-pool resource problems (the tragedy of the commons) and the inefficiency of equilibria in public-good games (the free rider problem). An application to market socialism shows that the problems of efficiency and distribution can be completely separated: the dead-weight loss of taxation disappears.     

Learning to play games in extensive form by valuation

Game theoretic models of learning which are based on the strategic form of the game cannot explain learning in games with large extensive form. We study learning in such games by using valuation of moves. A valuation for a player is a numeric assessment of her moves that purports to reflect their desirability. We consider a myopic player, who chooses moves with the highest valuation. Each time the game is played, the player revises her valuation by assigning the payoff obtained in the play to each of the moves she has made. We show for a repeated win-lose game that if the player has a winning strategy in the stage game, there is almost surely a time after which she always wins. When a player has more than two payoffs, a more elaborate learning procedure is required. We consider one that associates with each move the average payoff in the rounds in which this move was made. When all players adopt this learning procedure, with some perturbations, then, with probability 1 there is a time after which strategies that are close to subgame perfect equilibrium are played. A single player who adopts this procedure can guarantee only her individually rational payoff.     

Correlated Equilibrium in Stochastic Games

We study the existence of uniform correlated equilibrium payoffs in stochastic games. The correlation devices that we use are either autonomous (they base their choice of signal on previous signals, but not on previous states or actions) or stationary (their choice is independent of any data and is drawn according to the same probability distribution at every stage). We prove that any n-player stochastic game admits an autonomous correlated equilibrium payoff. When the game is positive and recursive, a stationary correlated equilibrium payoff exists. Journal of Economic Literature Classification Numbers: C72, C73.     

Information at equilibrium

Summary. In a game with rational expectations, individuals simultaneously refine their information with the information revealed by the strategies of other individuals. At a Nash equilibrium of a game with rational expectations, the information of individuals is essentially symmetric: the same profile of strategies is also an equilibrium of a game with symmetric information; and strategies are common knowledge. If each player has a veto act, which yields a minimum payoff that no other profile of strategies attains, then the veto profile is the only Nash equilibrium, and it is is an equilibrium with rational expectations and essentially symmetric information; which accounts for the impossibility of speculation. Received: June 20, 2001; revised version: January 9, 2002 RID="*" ID="*" We wish to thank Pierpaolo Battigalli, Fran?oise Forges, Franco Donzelli, Leonidas Koutsougeras, Aldo Rustichini, Rajiv Vohra and Nicholas Yannelis for their comments. Correspondence to: H. Polemarchakis     

Fiscal-monetary policy coordination and debt management: a two-stage analysis

We study interactions between two policymakers, central bank and government, in managing public debt as the result of a two-stage game. In the first stage, the institutional regime is established. This determines the equilibrium solution for the second stage, in which a differential game is played between the two policymakers. It is shown that, if the policymakers can communicate before the game is played (multiple-equilibrium), coordination problems can be solved by using the concept of correlated equilibrium.

Absorbing Team Games

A team is a group of people having the same motives but possibly different available actions. A team game is a game where two teams face each other. An absorbing game is a repeated game where some of the entries are absorbing, in the sense that once they are chosen the play terminates, and all future payoffs are equal to the payoff at the stage of termination. We prove that every absorbing team game has an equilibrium payoff and that there are -equilibrium profiles with cyclic structure. Journal of Economic Literature Classification Numbers: C72, C73.     

Oligopoly equilibria in exchange economies: a limit theorem

In a pure exchange economy, agents have the possibility of behaving strategically by putting only a part of their initial endowments on the market. An oligopoly equilibrium is defined to be a Nash equilibrium of the game in which agents choose simultaneously quantities to be put on the market. It is proved that under standard hypotheses, the oligopoly equilibrium leads to the competitive equilibrium when the economy is replicated an infinite number of times. Received: May 26, 1999; revised version: April 3, 2000     

Computationally restricted unmediated talk under incomplete information

Summary. We show the role of unmediated talk with computational complexity bounds as both an information transmission and a coordination device for the class of two-player games with incomplete information and rational parameters. We prove that any communication equilibrium payoff of such games can be reached as a Bayesian-Nash equilibrium payoff of the game extended by a two phase universal mechanism of interim computationally restricted pre-play communication. The communication protocols are designed with the help of modern cryptographic tools. A familiar context in which our results could be applied is bilateral trading with incomplete information.Received: 9 September 2002, Revised: 14 March 2003, JEL Classification Numbers: C72. Correspondence to: Amparo UrbanoWe wish to thank financial aid from the Valencian Institute of Economic Research (IVIE) and partial support by DIGCYT under project PB95 - 1074. A previous version of this work appears as IVIE Working Paper WP-AD 99-07, under the title: "Unmediated talk under incomplete information".     

Subgame Perfect Equilibria in Stage Games

It is well known that a stage game with infinite choice-sets, unless it contains a public coordination-device in each stage, may have no subgame perfect equilibria. We show that if a game with public coordination-devices has a subgame perfect equilibrium in which two players in each stage use non-atomic strategies, then the game without coordination devices also has a subgame perfect equilibrium. Journal of Economic Literature Classification Numbers: C6, C7, D8.     

Self-Fulfilling Mechanisms in Bayesian Games

Amechanismfor a Bayesian gameGis a mapping μ from the set of states of nature to the set of players' actions. μ isself-fulfillingif players are truthful at the communication stage and, given the information revealed by μ, no player can gain in unilaterally deviating from the action prescribed by the mechanism. We investigate the properties of self-fulfilling mechanisms and we show in particular that they correspond to inert solutions of the infinitely repeated game generated byG. We also discuss applications to market games, regulation, and R&D games.Journal of Economic LiteratureClassification Numbers: D82, C72.     

Message spaces for perfect correlated equilibria

Summary. We show that a perfect correlated equilibrium distribution of an N-person game, as defined by Dhillon and Mertens (1996) can be achieved using a finite number of copies of the strategy space as the message space.Received: 31 August 2004, Revised: 1 April 2005, JEL Classification Numbers: C72.Srihari Govindan: Correspondence toGovindan would like to thank the Social Sciences and Humanities Research Council of Canada for research support.     

Markov Perfect Equilibrium: I. Observable Actions

We define Markov strategy and Markov perfect equilibrium (MPE) for games with observable actions. Informally, a Markov strategy depends only on payoff-relevant past events. More precisely, it is measurable with respect to the coarsest partition of histories for which, if all other players use measurable strategies, each player's decision-problem is also measurable. For many games, this definition is equivalent to a simple affine invariance condition. We also show that an MPE is generically robust: if payoffs of a generic game are perturbed, there exists an almost Markovian equilibrium in the perturbed game near the initial MPE. Journal of Economic Literature Classification Numbers: C72, C73.     

Teaching Nash Equilibrium and Dominance: A Classroom Experiment on the Beauty Contest

Abstract: The authors' aim in this article was to show how the use of classroom experiments may be a good pedagogical tool to teach the Nash equilibrium (NE) concept. The basic game is a version of the beauty contest game (BCG), a simple guessing game in which repetition lets students react to other players' choices and converge iteratively to the equilibrium solution. The authors perform this experiment with undergraduate students with no previous training in game theory. After four rounds, they observe a clear decreasing tendency in the average submitted number in all groups. Thus, the findings show that by playing a repeated BCG, students quickly learn how to reach the NE solution.     

Reciprocity and Cooperation in Repeated Coordination Games: The Principled-Player Approach

Two long-lived players play a repeated coordination game. I show the restrictions on players' beliefs which imply that cooperation is optimal play. Journal of Economic Literature Classification Number: D83.     

Petty corruption

This paper analyzes a petty corruption model in which the entrepreneur’s type is drawn from an absolutely continuous probability distribution function F over [0, 1], and perfect Bayesian equilibrium is adopted as the solution concept for a one-stage game. In the one-stage game, if there is more than one bureaucrat, no project is approved with a strictly positive probability. For an infinitely repeated game, I show that the single window policy strictly increases the social benefits in a socially optimal equilibrium. I would like to thank Mukul Majumdar for valuable guidance and encouragement. I am also grateful to Kaushik Basu, Fernando Vega-Redondo, an anonymous referee, seminar participants at the international meeting for public economic theory (PET07) and especially Ani Guerdjikova and Roy Radner for helpful comments. Thanks are due to Hideaki Goto and Eunkyeong Lee for useful conversation.     

Implementations of the Nash solution based on its Walrasian characterization

Summary. The present paper provides three different support results for the Nash bargaining solution of -person bargaining games. First, for any bargaining game there is defined a non-cooperative game in strategic form, whose unique Nash equilibrium induces a payoff vector that coincides with the Nash solution of the bargaining game. Next this game is modified in such a way that the unique Nash equilibrium that supports the Nash solution is even in dominant strategies. After that an -stage game in extensive form is presented whose unique subgame perfect equilibrium supports the Nash solution of the bargaining game. Finally, the support results are shown to induce implementation results in the sense of mechanism theory. Received: October 3, 1999; revised version: October 26, 1999