Credible assignments in coordination games

This paper uses the experimental method to examine an arbiter's ability to determine the outcome of two-person coordination games. All of the arbiter's assignments in the experiments were strict equilibrium points, but some assignments violated payoff-dominance or symmetry. An assignment that corresponds to the game's outcome is a credible assignment. The experiments test the hypothesis that an assignment to a strict equilibrium is a credible assignment. Our subjects did not find the individual rationality and mutual consistency of an equilibrium assignment to be sufficient reason for implementing the assignment when doing so conflicts with payoff-dominance or symmetry.     

The strategic value of recall

This work studies the value of two-person zero-sum repeated games in which at least one of the players is restricted to (mixtures of) bounded recall strategies. A (pure) k-recall strategy is a strategy that relies only on the last k periods of history. This work improves previous results ( [Lehrer, 1988] and [Neyman and Okada, 2009]) on repeated games with bounded recall. We provide an explicit formula for the asymptotic value of the repeated game as a function of the one-stage game, the duration of the repeated game, and the recall of the agents.     

Finitely repeated games with monitoring options

We study finitely repeated games where players can decide whether to monitor the other players? actions or not every period. Monitoring is assumed to be costless and private. We compare our model with the standard one where the players automatically monitor each other. Since monitoring other players never hurts, any equilibrium payoff vector of a standard finitely repeated game is an equilibrium payoff vector of the same game with monitoring options. We show that some finitely repeated games with monitoring options have sequential equilibrium outcomes which cannot be sustained under the standard model, even if the stage game has a unique Nash equilibrium. We also present sufficient conditions for a folk theorem, when the players have a long horizon.     

When a Precedent of Donation Favors Defection in the Prisoner's Dilemma

Abstract. In this paper, we examine the question of whether a collective activity can influence cooperation in a subsequent repeated one‐shot prisoner's dilemma (PD) game. We conduct two series of experiments. The first consists of control experiments in which 30 periods of a PD game are played, with a random rematching of the pairs in every period. In a second series of experiments, subjects first play a donation game (DG) and then the PD game. In the DG, they collectively discuss the amount of a donation to a given charity, before putting the question to an individual and anonymous vote. Cooperation levels in the PD games preceded by the DG are significantly lower than those observed in the control experiment.     

Credible group stability in many-to-many matching problems

It is known that in two-sided many-to-many matching problems, pairwise-stable matchings may not be immune to group deviations, unlike in many-to-one matching problems (Blair, 1988). In this paper, we show that pairwise stability is equivalent to credible group stability when one side has responsive preferences and the other side has categorywise-responsive preferences. A credibly group-stable matching is immune to any “executable” group deviations with an appropriate definition of executability. Under the same preference restriction, we also show the equivalence between the set of pairwise-stable matchings and the set of matchings generated by coalition-proof Nash equilibria of an appropriately defined strategic-form game.     

Efficient assignment respecting priorities

A widespread practice in assignment of heterogeneous indivisible objects is to prioritize some recipients over others depending on the type of the object. Leading examples include assignment of public school seats, and allocation of houses, courses, or offices. Each object comes with a coarse priority ranking over recipients. Respecting such priorities constrains the set of feasible assignments, and therefore might lead to inefficiency, highlighting a tension between respecting priorities and Pareto efficiency. Via an easily verifiable criterion, we fully characterize priority structures under which the constrained efficient assignments do not suffer from such welfare loss, and the constrained efficient rule (CER) is indeed efficient. We also identify the priority structures for which the CER is singleton-valued and group strategy-proof.     

Equilibrium selection in similar repeated games: experimental evidence on the role of precedents

We report on an experiment examining behavior and equilibrium selection in two similar, infinitely repeated games, Stag Hunt and Prisoner’s Dilemma under anonymous random matching. We are interested in the role that historical precedents may play for equilibrium selection between these two repeated games. We find that a precedent for efficient play in the repeated Stag Hunt game does not carry over to the repeated Prisoner’s Dilemma game despite the possibility that efficient play can be sustained as an equilibrium of the indefinitely repeated game. Similarly, a precedent for inefficient play in the repeated Prisoner’s Dilemma game does not extend to the repeated Stag Hunt game. We conclude that equilibrium selection between similar repeated games may have less to do with historical precedents and might instead depend more on strategic considerations associated with the different payoffs of these similar repeated games.     

UNIQUENESS OF EQUILIBRIUM PAYOFFS IN FINITELY REPEATED GAMES WITH IMPERFECT MONITORING*

This paper examines when a finitely repeated game with imperfect monitoring has a unique equilibrium payoff vector. This problem is nontrivial under imperfect monitoring, because uniqueness of equilibrium (outcome) in the stage game does not extend to finitely repeated games. A (correlated) equilibrium is equilibrium minimaxing if any player's equilibrium payoff is her minimax value when the other players choose a correlated action profile from the actions played in the equilibrium. The uniqueness result holds if all stage game correlated equilibria are equilibrium minimaxing and have the same payoffs. The uniqueness result does not hold under weaker conditions.     

Connecting the cooperative and competitive structures of the multiple-partners assignment game

Multiple-partners assignment game is the name used by Sotomayor [The multiple partners game, in: M. Majumdar (Ed.), Equilibrium and Dynamics: Essays in Honor of David Gale, The Macmillan Press Ltd., New York, 1992; The lattice structure of the set of stable outcomes of the multiple partners assignment game, Int. J. Game Theory 28 (1999) 567-583] to describe the cooperative structure of the many-to-many matching market with additively separable utilities. Stability concept is proved to be different from the core concept. An economic structure is proposed where the concept of competitive equilibrium payoff is introduced in connection to the equilibrium concept from standard microeconomic theory. The paper examines how this equilibrium concept compares with the cooperative equilibrium concept. Properties of interest to the cooperative and competitive markets are derived.     

Decentralized learning from failure

We study decentralized learning in organizations. Decentralization is captured through Crawford and Haller's [Learning how to cooperate: optimal play in repeated coordination games, Econometrica 58 (1990) 571-595] attainability constraints on strategies. We analyze a repeated game with imperfectly observable actions. A fixed subset of action profiles are successes and all others are failures. The location of successes is unknown. The game is played until either there is a success or the time horizon is reached. We partially characterize optimal attainable strategies in the infinite horizon game by showing that after any fixed time, agents will occasionally randomize while at the same time mixing probabilities cannot be uniformly bounded away from zero.     

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.     

Minimizing selection bias in randomized trials: A Nash equilibrium approach to optimal randomization

Randomized trials can be compromised by selection bias, particularly when enrollment is sequential and previous assignments are unmasked. In such contexts, an appropriate randomization procedure minimizes selection bias while satisfying the need for treatment balance. This paper presents optimal randomization mechanisms based on non-cooperative game theory and the statistics of selection bias. For several different clinical trial examples, we examine subgame-perfect Nash equilibrium, which dictates a probability distribution on suitable assignment sequences. We find that optimal procedures do not involve discrete uniform distributions, because minimizing predictability is not equivalent to minimizing selection bias.     

How economic rewards affect cooperation reconsidered

Recent studies suggest that payoffs in cents, compared to dollars, produce less defection in a repeated prisoner’s dilemma game. We are unable to replicate these findings with conventional economic procedures or in a direct replication.     

Learning, teaching, and turn taking in the repeated assignment game

History-dependent strategies are often used to support cooperation in repeated game models. Using the indefinitely repeated common-pool resource assignment game and a perfect stranger experimental design, this paper reports novel evidence that players who have successfully used an efficiency-enhancing turn taking strategy will teach other players in subsequent supergames to adopt this strategy. We find that subjects engage in turn taking frequently in both the Low Conflict and the High Conflict treatments. Prior experience with turn taking significantly increases turn taking in both treatments. Moreover, successful turn taking often involves fast learning, and individuals with turn taking experience are more likely to be teachers than inexperienced individuals. The comparative statics results show that teaching in such an environment also responds to incentives, since teaching is empirically more frequent in the Low Conflict treatment with higher benefits and lower costs.     

Collusion as public monitoring becomes noisy: Experimental evidence

This paper uses laboratory experiments to test the implications of the theory of repeated games on equilibrium payoffs and estimate strategies in an infinitely repeated prisoners' dilemma game with imperfect public monitoring. We find that subjects' payoffs (i) decrease as noise increases, and (ii) are lower than the theoretical maximum for low noise, but exceed it for high noise. Under the assumption that the subjects' strategy uses thresholds on the public signal for transition between cooperation and punishment states, we find that the best fitting strategy simply compares the most recent public signal against a single threshold.     

Ordinal efficiency and dominated sets of assignments

Using lotteries is a common tool for allocating indivisible goods. Since obtaining preferences over lotteries is often difficult, real-life mechanisms usually rely on ordinal preferences over deterministic outcomes. Bogomolnaia and Moulin (J. Econom. Theory 19 (2002) 623) show that the outcome of an ex post efficient mechanism may be stochastically dominated. They define a random assignment to be ordinally efficient if and only if it is not stochastically dominated. In this paper we investigate the relation between ex post efficiency and ordinal efficiency. We introduce a new notion of domination defined over sets of assignments and show that a lottery induces an ordinally efficient random assignment if and only if each subset of the full support of the lottery is undominated.     

The evolution of rationality and the Red Queen

Strategic rationality is subjected here to natural selection. In a zero-sum repeated game of incomplete information, one long-run individual is informed of the state of the world, and plays against a sequence of short-run opponents who are not. Strategies are noisy and have bounded recall. An equilibrium in these is shown to exist. Relative to any such equilibrium, sufficiently greater recall enjoys an advantage that is not decreasing in the original level of recall, thus capturing the Red Queen effect. The selection pressure to reduce a small amount of noise is less than that to increase recall.     

Overcoming coordination failure using a mechanism based on gradualism and endogeneity

We examine three tools that can enhance coordination success in a repeated multiple-choice coordination game. Gradualism means that the game starts as an easy coordination problem and moves gradually to a more difficult one. The Endogenous Ascending mechanism implies that a gradual increase in the upper bound of coordination occurs only if coordination with the Pareto superior equilibrium in a stage game is attained. The Endogenous Descending mechanism requires that when the game’s participants fail to coordinate, the level of the next coordination game be adjusted such that the game becomes simpler. We show that gradualism may not always work, but in such instances, its effect can be reinforced by endogeneity. Our laboratory experiment provides evidence that a mechanism that combines three tools, herein termed the “Gradualism with Endogenous Ascending and Descending (GEAD)” mechanism, works well. We discuss how the GEAD mechanism can be applied to real-life situations that suffer from coordination failure.     

Generalized assignment models: with an applicationto technology transfer

Summary.  We consider a generalized assignment model where the payoffs depend on the number of matchings that take place. We formulate a simple non-cooperative game and look for subgame perfect equilibrium of this model. Existence is established for a wide class of games. We also look at a refinement criterion which, for the standard assignment model, selects the -optimal outcome as the unique equilibrium. We then apply these concepts to a model of technology transfer between domestic and foreign firms. Received: June 24, 1994; revised version October 12, 1995     

It is Hobbes, not Rousseau: an experiment on voting and redistribution

We perform an experiment which provides a laboratory replica of some important features of the welfare state. In the experiment, all individuals in a group decide whether to make a costly effort, which produces a random (independent) outcome for each one of them. The group members then vote on whether to redistribute the resulting and commonly known total sum of earnings equally amongst themselves. This game has two equilibria, if played once. In one of them, all players make effort and there is little redistribution. In the other one, there is no effort and nothing to redistribute. A solution to the repeated game allows for redistribution and high effort, sustained by the threat to revert to the worst of these equilibria. Our results show that redistribution with high effort is not sustainable. The main reason for the absence of redistribution is that rich agents do not act differently depending on whether the poor have worked hard or not. The equilibrium in which redistribution may be sustained by the threat of punishing the poor if they do not exert effort is not observed in the experiment. Thus, the explanation of the behavior of the subjects lies in Hobbes, not in Rousseau.