Evolutionary stability of discrimination under observability

We study the evolution of preferences under perfect and almost perfect observability in symmetric 2-player games. We demonstrate that if nature can choose from a sufficiently general preference space, which includes preferences over outcomes that may depend on the opponent's preference-type, then, in most games, only discriminating preferences (treating different types of opponents differently in the same situation) can be evolutionary stable and some discriminating types are stable in a very strong sense in all games. We use these discriminating types to show that any symmetric outcome which gives players more than their minmax value in material payoffs (fitness) can be seen as equilibrium play of a player population with such strongly stable preferences.     

Evolutionary stability of discrimination under observability

We study the evolution of preferences under perfect and almost perfect observability in symmetric 2-player games. We demonstrate that if nature can choose from a sufficiently general preference space, which includes preferences over outcomes that may depend on the opponent's preference-type, then, in most games, only discriminating preferences (treating different types of opponents differently in the same situation) can be evolutionary stable and some discriminating types are stable in a very strong sense in all games. We use these discriminating types to show that any symmetric outcome which gives players more than their minmax value in material payoffs (fitness) can be seen as equilibrium play of a player population with such strongly stable preferences.     

A Backward Induction Experiment

This paper reports experiments with one-stage and two-stage alternating-offers bargaining games. Payoff-interdependent preferences have been suggested as an explanation for experimental results that are commonly inconsistent with players' maximizing their monetary payoffs and performing backward induction calculations. We examine whether, given payoff-interdependent preferences, players respect backward induction. To do this, we break backward induction into its components, subgame consistency and truncation consistency. We examine each by comparing the outcomes of two-stage bargaining games with one-stage games with varying rejection payoffs. We find and characterize systematic violations of both subgame and truncation consistency. Journal of Economic Literature Classification Numbers: C70, C78.     

Expressed preferences and behavior in experimental games

Participants in experimental games typically can only choose actions, without making comments about other participants' future actions. In sequential two-person games, we allow first movers to express a preference between responder choices. We find that responder behavior differs substantially according to whether first movers express a hope for favorable or unfavorable treatment. Responders largely ignore first movers' expressed preferences for favorable responses, however, when the first movers misbehave. As in earlier experiments without preference expression, subjects assign a high positive weight to another person's payoffs when ahead and misbehavior elicits a strong negative response. Logit regressions estimate the weight placed on another (non-misbehaving) person's payoffs to be positive, even when one is behind. There is suggestive evidence that positive reciprocity is enhanced when a preference for favorable treatment is expressed.     

Aggregate comparative statics

In aggregative games, each playerʼs payoff depends on her own actions and an aggregate of the actions of all the players. Many common games in industrial organization, political economy, public economics, and macroeconomics can be cast as aggregative games. This paper provides a general and tractable framework for comparative static results in aggregative games. We focus on two classes of games: (1) aggregative games with strategic substitutes and (2) nice aggregative games, where payoff functions are continuous and concave in own strategies. We provide simple sufficient conditions under which positive shocks to individual players increase their own actions and have monotone effects on the aggregate. The results are illustrated with applications to public good provision, contests, Cournot competition and technology choices in oligopoly.     

A Property of Nash Equilibria in Repeated Games with Incomplete Information

We consider two-person non-zero-sum infinitely repeated games with lack of information on one side. The characterization of Nash equilibrium payoffs obtained by Hart allows for complex strategies, which are actually required by some equilibrium payoffs in some games. We show that appropriate one-shot public communication mechanisms make Nash equilibrium payoffs achievable by means of simple strategies. Furthermore, these mechanisms satisfy a notion of self-fulfillment.Journal of Economic LiteratureClassification Numbers: D82, C72.     

Preference Evolution,Two-Speed Dynamics,and Rapid Social Change

We present a dynamic analysis of the evolution of preferences in a strategic environment. In our model, each player's behavior depends on both the game's payoffs and his idiosyncratic biases, but only the game's payoffs determine his evolutionary success. Dynamics run at two speeds at once; while natural selection slowly reshapes the distribution of preferences, players quickly learn to behave as their preferences dictate. We establish the existence and uniqueness of the paired trajectories of society's preferences and behavior. While aggregate behavior adjusts smoothly in equilibration games, in coordination games aggregate behavior can jump discretely in an instant of evolutionary time. Journal of Economic Literature Classification Numbers: C72, C73.     

On games with identical equilibrium payoffs

Summary. This paper compares the sets of Nash, coalition- proof Nash and strong Nash equilibrium payoffs of normal form games which are closely related. We propose sufficient conditions for equivalent or closely related games to have identical sets of equilibrium payoffs. Received: April 23, 1999; revised version: November 23, 1999     

Rent, risk, and replication: Preference adaptation in winner-take-all markets

We study the evolution of an economy where agents who are heterogeneous with respect to risk attitudes can either earn a certain income or enter a risky rent-seeking contest. We assume that agents behave rationally given their preferences, but that the population distribution of preferences evolves over time in response to material payoffs. We show that, in particular, initial distributions with full support converge to stationary states where all types are still present. Although rents are perfectly dissipated in material terms at a steady state, efficiency is greater than if everybody had been risk neutral, since risk lovers specialize in rent seeking.     

Are the treasures of game theory ambiguous?

Goeree and Holt (Am Econ Rev 91:1402?C1422, 2001) experimentally study a number of games. In each case, they initially find strong support for Nash equilibrium; however, by changing an apparently irrelevant parameter, they find results which contradict Nash equilibrium. In this paper, we study the five normal form games from Goeree and Holt (Am Econ Rev 91:1402?C1422, 2001). We argue that their results may be explained by the hypothesis that subjects view their opponents?? behaviour as ambiguous. Ambiguity-aversion causes players to avoid strategies, which give low out of equilibrium payoffs. Similarly, ambiguity preference can make strategies with high payoffs more attractive.     

Endogenous transfers in the Prisoner's Dilemma game: An experimental test of cooperation and coordination

We test a two-stage compensation mechanism for promoting cooperation in Prisoner's Dilemma games. Players first simultaneously choose binding non-negative amounts to pay their counterparts for cooperating, and then play the induced game knowing these amounts. In our games, all payment pairs consistent with mutual cooperation in subgame-perfect equilibrium transform these games into coordination games, with both mutual cooperation and mutual defection as Nash equilibria in the second stage. When endogenous transfer payments are not permitted, cooperation is much less likely. Mutual cooperation is most likely when the (sufficient) payments are identical, and it is also substantially more likely with payment pairs that bring the mutual-cooperation payoffs closer together. Both the Fehr–Schmidt and Charness–Rabin models predict that transfers that make final payoffs closer are preferred; however, they do not explain why equal transfers are particularly effective. Transfers are also effective in sustaining cooperation even when they are imposed and not chosen.     

Equilibrium selection and the dynamic evolution of preferences

A population of fully rational agents plays a symmetric 2-player game in biological fitnesses, but each agent?s play is determined by his payoffs, which are free to evolve according to “survival of the fittest” pressures. An equilibrium-selection mechanism is assumed to exist, and deliver a unique outcome for any given profile of payoffs; this allows the evolution of payoffs to be modeled as a well-defined replicator dynamics. The existing static stability results that “efficient strict Nash implies stability” and “stability implies efficiency” are translated to this dynamic context, although the latter gives way to indeterminacy in the absence of a specific equilibrium-selection mechanism. A strong form of stability is established for the efficient outcome of games with common interests, whilst a weaker stability result is provided for efficient mixed-strategy equilibria of doubly symmetric games. The results are illustrated using the equilibrium-selection mechanism provided by global games.     

Experimental internet auctions with random information retrieval

We run an experiment where 97 subjects could retrieve records of completed past auctions before placing their bids in current one-bid, two-bid, and auction-selection games. Each subject was asked to participate in 3 current auctions; but could retrieve up to 60 records of completed (past) auctions. The results reveal a positive relation between the payoffs earned by the subjects and their history-inspection effort. Subjects act as if responding to the average bidding-ratios of the winners in the samples that they have retrieved. They apply intuitive signal-dependent stopping rules like “sample until observing a winner-value close to my won” or “find a close winner-value and try one more history” when sampling the databases. History-inspection directs bidders with relatively high private-valuations to moderate bidding which increases their realized payoffs. (JEL C9 D4 D8) Electronic Supplementary Material Supplementary material is available in the online version of this article at . JEL Classification C93, D44, D83     

Bounding the inefficiency of equilibria in nonatomic congestion games

Equilibria in noncooperative games are typically inefficient, as illustrated by the Prisoner's Dilemma. In this paper, we quantify this inefficiency by comparing the payoffs of equilibria to the payoffs of a “best possible” outcome. We study a nonatomic version of the congestion games defined by Rosenthal [Int. J. Game Theory 2 (1973) 65], and identify games in which equilibria are approximately optimal in the sense that no other outcome achieves a significantly larger total payoff to the players—games in which optimization by individuals approximately optimizes the social good, in spite of the lack of coordination between players. Our results extend previous work on traffic routing games.     

Evolution in games with randomly disturbed payoffs

We consider a simple model of stochastic evolution in population games. In our model, each agent occasionally receives opportunities to update his choice of strategy. When such an opportunity arises, the agent selects a strategy that is currently optimal, but only after his payoffs have been randomly perturbed. We prove that the resulting evolutionary process converges to approximate Nash equilibrium in both the medium run and the long run in three general classes of population games: stable games, potential games, and supermodular games. We conclude by contrasting the evolutionary process studied here with stochastic fictitious play.     

Stable games and their dynamics

We study a class of population games called stable games. These games are characterized by self-defeating externalities: when agents revise their strategies, the improvements in the payoffs of strategies to which revising agents are switching are always exceeded by the improvements in the payoffs of strategies which revising agents are abandoning. We prove that the set of Nash equilibria of a stable game is globally asymptotically stable under a wide range of evolutionary dynamics. Convergence results for stable games are not as general as those for potential games: in addition to monotonicity of the dynamics, integrability of the agents' revision protocols plays a key role.     

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.     

Belief-free equilibria in games with incomplete information: Characterization and existence

We generalize the results of Hörner and Lovo (2009) [15] to N-player games with arbitrary information structure. First, we characterize the set of belief-free equilibrium payoffs under low discounting as the set of feasible payoffs that are individually rational, jointly rational, and incentive compatible. Second, we provide necessary and sufficient conditions on the information structure for this set to be non-empty.     

Infinite horizon common interest games with perfect information

We consider infinite horizon common interest games with perfect information. A game is a K-coordination game if each player can decrease other players' payoffs by at most K times his own cost of punishment. The number K represents the degree of commonality of payoffs among the players. The smaller K is, the more interest the players share. A K-coordination game tapers off if the greatest payoff variation conditional on the first t periods of an efficient history converges to 0 at a rate faster than K^−t as t→∞. We show that every subgame perfect equilibrium outcome is efficient in any tapering-off game with perfect information. Applications include asynchronously repeated games, repeated games of extensive form games, asymptotically finite horizon games, and asymptotically pure coordination games.