Fictitious play property of the Nash demand game

We show that the Nash demand game has the fictitious play property. We also show that almost every fictitious play process and its associated belief path converge to a pure-strategy Nash equilibrium in the Nash demand game.     

Species survival and evolutionary stability in sustainable habitats

Abstract. Whoever exists belongs to a species, which did not become extinct, has a (geno-)type, which should be well adjusted, and lives in a habitat which has been sustainable for a long time. We do not only analyze interspecies competition and the conditions for species survival, but also intraspecies competition of (geno-)types as in evolutionary biology and game theory. Survival in inter- and intraspecies competition together with sustainability define ecological stability, a concept which we illustrate by an example of solitary and social grazers who compete for food supply and who are endangered by the same predators. Although our approach is inspired by empirical evidence, no systematic attempt is made to apply it to some specific ecology.     

Voluntary contributions to a joint project with asymmetric agents

We revisit Admati and Perry (1991)'s model of voluntary contributions to a joint project. Their main result that equilibrium contributions are small appears not to be robust to the introduction of asymmetries.     

Learning in games with strategic complementarities revisited

Fictitious play is a classical learning process for games, and games with strategic complementarities are an important class including many economic applications. Knowledge about convergence properties of fictitious play in this class of games is scarce, however. Beyond games with a unique equilibrium, global convergence has only been claimed for games with diminishing returns [V. Krishna, Learning in games with strategic complementarities, HBS Working Paper 92-073, Harvard University, 1992]. This result remained unpublished, and it relies on a specific tie-breaking rule. Here we prove an extension of it by showing that the ordinal version of strategic complementarities suffices. The proof does not rely on tie-breaking rules and provides some intuition for the result.     

A theory of political cycles

We study how the proximity of elections affects policy choices in a model in which policymakers want to improve their reputation to increase their reelection chances. Policymakers' equilibrium decisions depend on both their reputation and the proximity of the next election. Typically, incentives to influence election results are stronger closer to the election (for a given reputation level), as argued in the political cycles literature, and these political cycles are less important when the policymaker's reputation is better. Our analysis sheds light on other agency relationships in which part of the compensation is decided upon infrequently.     

When mandatory disclosure hurts: Expert advice and conflicting interests

We study the quality of advice that an informed and biased expert gives to an uninformed decision maker. We compare two scenarios: mandatory disclosure of the bias and nondisclosure, where information about the bias can only be revealed through cheap-talk. We find that in many scenarios nondisclosure allows for higher welfare for both parties. Hiding the bias allows for more precise communication for the more biased type and, if different types are biased in different directions, may allow for the same for the less biased type. We identify contexts where equilibrium revelation allows but mandatory disclosure prevents meaningful communication.     

Learning in games with unstable equilibria

We propose a new concept for the analysis of games, the TASP, which gives a precise prediction about non-equilibrium play in games whose Nash equilibria are mixed and are unstable under fictitious play-like learning. We show that, when players learn using weighted stochastic fictitious play and so place greater weight on recent experience, the time average of play often converges in these “unstable” games, even while mixed strategies and beliefs continue to cycle. This time average, the TASP, is related to the cycle identified by Shapley [L.S. Shapley, Some topics in two person games, in: M. Dresher, et al. (Eds.), Advances in Game Theory, Princeton University Press, Princeton, 1964]. The TASP can be close to or quite distinct from Nash equilibrium.     

Hope springs eternal: learning and the stability of cooperation in short horizon repeated games

This paper considers learning rates in finitely repeated prisoners’ dilemmas. If players think their opponents might be relatively cooperative (e.g., tit-for-tat or grim types), they will cooperate in finitely repeated prisoners’ dilemmas (see Kreps et al., J. Econom. Theory 27 (1982) 245). However, if there are actually no cooperative types, players will eventually learn this and cooperation will break down. This paper shows that this learning is extremely slow, so it will take an extremely long time for cooperation to break down.Thus, suppose the world is either “good” or “bad.” The probability of a grim type is δ>0 if the world is good, and zero if the world is bad. Successive generations pair up to play finitely repeated prisoners’ dilemmas. Players observe play in previous generations and use Bayes’ rule to update their prior, π, that the world is good. We show that, if the world is really bad, then π falls per generation on average. Thus, if δ is small, there is less cooperation if the world is good, but cooperation may become more stable. For a representative 19 period repeated prisoners’ dilemma, beliefs fall one percentage point on average after a thousand generations.To derive these learning rates, we must refine existing results on the sensitivity of repeated games to Kreps et al. (1982) type perturbations. Specifically, we show cooperation is possible in perturbed prisoners’ dilemmas repeated O(log(1/δ)) times. This improves significantly on the O(1/δ) results in previous work. The paper thus provides two new reasons why cooperation tends to be stable, even in short horizon repeated games.     

Testing the TASP: An experimental investigation of learning in games with unstable equilibria

We report experiments studying mixed strategy Nash equilibria that are theoretically stable or unstable under learning. The Time Average Shapley Polygon (TASP) predicts behavior in the unstable case. We study two versions of Rock-Paper-Scissors that include a fourth strategy, Dumb. The unique Nash equilibrium is identical in the two games, but the predicted frequency of Dumb is much higher in the game where the NE is stable. Consistent with TASP, the observed frequency of Dumb is lower and play is further from Nash in the high payoff unstable treatment. However, Dumb is played too frequently in all treatments.     

On the convergence of reinforcement learning

This paper examines the convergence of payoffs and strategies in Erev and Roth's model of reinforcement learning. When all players use this rule it eliminates iteratively dominated strategies and in two-person constant-sum games average payoffs converge to the value of the game. Strategies converge in constant-sum games with unique equilibria if they are pure or if they are mixed and the game is 2×2. The long-run behaviour of the learning rule is governed by equations related to Maynard Smith's version of the replicator dynamic. Properties of the learning rule against general opponents are also studied.     

Bargaining foundations of the median voter theorem

We give a game-theoretic foundation for the median voter theorem in a one-dimensional bargaining model based on Baron and Ferejohn's [D. Baron, J. Ferejohn, Bargaining in legislatures, Amer. Polit. Sci. Rev. 83 (1989) 1181-1206] model of distributive politics. We prove that as the agents become arbitrarily patient, the set of proposals that can be passed in any pure strategy, subgame perfect equilibrium collapses to the median voter's ideal point. While we leave the possibility of some delay, we prove that the agents' equilibrium continuation payoffs converge to the utility from the median, so that delay, if it occurs, is inconsequential. We do not impose stationarity or any other refinements. Our result counters intuition based on the folk theorem for repeated games, and it contrasts with the known result for the distributive bargaining model that as agents become patient, any division of the dollar can be supported as a subgame perfect equilibrium outcome.     

Fictitious play in 2×n games

It is known that every discrete-time fictitious play process approaches equilibrium in nondegenerate 2×2 games, and that every continuous-time fictitious play process approaches equilibrium in nondegenerate 2×2 and 2×3 games. It has also been conjectured that convergence to the set of equilibria holds generally for nondegenerate 2×n games. We give a simple geometric proof of this for the continuous-time process, and also extend the result to discrete-time fictitious play.     

Bargaining and markets: complexity and the competitive outcome

Rubinstein and Wolinsky (Rev. Econ. Stud. 57 (1990) 63-78) consider a simple decentralised market game in which agents meet randomly or voluntarily and bargain over the terms of trade. They show that any individually rational price can be sustained as a sequential equilibrium even though the model has a unique competitive outcome. Here, I consider Rubinstein and Wolinsky's model and show that if complexity costs of implementing strategies enter players’ preferences, together with the standard payoff in the game, then every equilibrium is stationary/Markov and induces the unique competitive price. Thus, I demonstrate that aversion to complexity may provide a justification for the competitive outcome.     

Stability and limit cycles in one-dimensional dynamic optimisations of competitive agents with a market externality

This paper considers low dimensional (more precisely, one state variable) dynamic optimisation problems of competitive agents. These individual decisions lead to a dynamic externality for the evolution of the system. However, the impact of an individual and competitive agent is negligible and thus each agent considers this evolution as exogenous data. This leads, assuming rational expectations (perfect foresight due to the deterministic set up), to motions in the three dimensional space of state, costate and externality. Considering the fact that such externalities are widespread, e.g., R&D in the literature on new growth theory, pollution in environmental economics, etc., the incorporation of such externalities due to competitive markets is important, yet this incorporation may alter the stability of the system. Indeed, complex policies such as stable limit cycles are sustainable in such a low-dimensional economy, even for a separable and strictly concave model.     

Structural holes in social networks: A remark

In a recent article, [S. Goyal, F. Vega-Redondo, Structural holes in social networks, J. Econ. Theory 137 (1) (2007) 460-492] the authors (GVR) showed the importance of stars and cycles in a given network formation game. Implicitly, in their article, a network is called an equilibrium if it is generated by an equilibrium strategy. We extend the results of GVR to the case of a stronger requirement: namely, that a network can be called an equilibrium only if all the strategies generating it are equilibria. We also show, in a dynamic framework, that both definitions differ in crucial ways.     

Incentive effects: The case of belief elicitation from individuals in groups

Non-incentivized belief elicitation has a negative effect on the belief accuracy of experienced observers predicting choices in 2 × 2 matrix games. This negative impact extends to the accuracy of group beliefs and revised beliefs after forecasters know each other's initial beliefs.     

Dynamic coordination with individual learning

We study coordination in dynamic global games with private learning. Players choose whether and when to invest irreversibly in a project whose success depends on its quality and the timing of investment. Players gradually learn about project quality. We identify conditions on temporal incentives under which, in sufficiently long games, players coordinate on investing whenever doing so is not dominated. Roughly speaking, this outcome occurs whenever players? payoffs are sufficiently tolerant of non-simultaneous coordination. We also identify conditions under which players coordinate on the risk-dominant action. We provide foundations for these results in terms of higher order beliefs.     

Sorting versus screening: Search frictions and competing mechanisms

In a market where sellers compete by posting trading mechanisms, we allow for a general search technology and show that its features crucially affect the equilibrium mechanism. Price posting prevails when meetings are rival, i.e., when a meeting by one buyer reduces another buyer's meeting probability. Under price posting buyers reveal their type by sorting ex-ante. Only if the meeting technology is sufficiently non-rival, price posting is not an equilibrium. Multiple buyer types then visit the same sellers who screen ex-post through auctions.     

Perturbed communication games with honest senders and naive receivers

This paper studies communication games in which the sender is possibly honest (tells the truth) and the receiver is possibly naive (follows messages as if truthful). The characterization of message-monotone equilibria in the perturbed games explain several important aspects of strategic communication including sender exaggeration, receiver skepticism and message clustering. Surprisingly, the strategic receiver may respond to more aggressive claims with more moderate actions. In the limit as the probabilities of the non-strategic players approach zero, (i) the limit equilibrium corresponds to a most-informative equilibrium of the limit (Crawford-Sobel) game; (ii) only the top messages are sent.     

Coordination failure in repeated games with private monitoring

Players coordinate continuation play in repeated games with public monitoring. We investigate the robustness of such equilibrium behavior with respect to ex-ante small private-monitoring perturbations. We show that with full support of public signals, no perfect public equilibrium is robust if it induces a “regular” 2×2$2\times 2$ coordination game in the continuation play. This regularity condition is violated in all belief-free equilibria. Indeed, with an individual full rank condition, every interior belief-free equilibrium is robust. We also analyze block belief-free equilibria and point out that the notion of robustness is sensitive to whether we allow for uninterpretable signals.