Renegotiation in Repeated Games with Side-Payments

We consider repeated games with side-payments: players have an endowment of wealth in each period in which transfers can be made. We show that if endowments are large enough and the common discount factor high enough, then a strongly renegotiation–proof equilibrium (SRP) in the sense of Farrell and Maskin exists. As the discount factor goes to 1, the set of SRP payoffs converges to the set of efficient, individually rational payoffs. These results provide a justification for the efficiency principle when agreements are not enforceable. Journal of Economic Literature Classification Numbers: C73, D23, L14.     

Player Types and Self-Impression Management in Dictatorship Games: Two Experiments

Recent experimental research on dictatorship games shows that many dictators share their outcomes with unknown, anonymous others. The data suggests that dictators can be “typed” as rational (taking the maximum), equal (splitting outcomes equally), or “other.” This paper experimentally tests the self-impression management model, which predicts that individuals act to show themselves in a positive light, even when they are the only observer of their own behavior. The model predicts that the “other” type of dictator will avoid being greedy by taking more only as their choices are increasingly restricted. Results from two experiments support the model's predictions. The conclusion advocates differentiating basic psychological motivations in modeling individual behavior. Journal of Economic Literature Classification Numbers: C78, C91, D63.     

Minimizing Regret: The General Case

In repeated games with differential information on one side, the labelling “general case” refers to games in which the action of the informed player is not known to the uninformed, who can only observe a signal which is the random outcome of his and his opponent's action. Here we consider the problem of minimizing regret (in the sense first formulated by J. Hannan (1956, in Contributions to the Theory of Games, Vol. III, Annals of Mathematics Studies, Vol. 39, Princeton, NJ: Princeton Univ. Press.) when the information available is of this type. We give a simple condition describing the approachable set. Journal of Economic Literature Classification Number: D81, D82, D83.     

Conditional Universal Consistency

Players choose an action before learning an outcome chosen according to an unknown and history-dependent stochastic rule. Procedures that categorize outcomes, and use a randomized variation on fictitious play within each category are studied. These procedures are “conditionally consistent:” they yield almost as high a time-average payoff as if the player knew the conditional distributions of actions given categories. Moreover, given any alternative procedure, there is a conditionally consistent procedure whose performance is no more than epsilon worse regardless of the discount factor. We also discuss cycles, and argue that the time-average of play should resemble a correlated equilibrium. Journal of Economic Literature Classification Numbers: C72, C73, C63, D83.     

Averting economic collapse and the solipsism bias

We study the behavior of experimental subjects who have to make a sequence of risky investment decisions in the presence of network externalities. Subjects follow a simple heuristic—investing after positive experiences and reducing their propensity to invest after a failure. This result contrasts with the theoretical findings of Jeitschko and Taylor [Jeitschko, T.D., Taylor, C., 2001. Local discouragement and global collapse: A theory of coordination avalanches. Amer. Econ. Rev. 91 (1), 208–224] in which even agents who have only good experiences eventually stop investing because they account for the fact that others with worse experiences will quit. This can trigger sudden economic collapse—a coordination avalanche—even in the most efficient Bayesian equilibrium. In the experiment, subjects follow their own experiences and disregard the possible bad experiences of others—thus exhibiting behavior that we term “solipsism bias.” Solipsism results in sustained investment activity and thus averts complete collapse.     

Learning to Learn, Pattern Recognition, and Nash Equilibrium

The paper studies a large class of bounded-rationality, probabilistic learning models on strategic-form games. The main assumption is that players “recognize” cyclic patterns in the observed history of play. The main result is convergence with probability one to a fixed pattern of pure strategy Nash equilibria, in a large class of “simple games” in which the pure equilibria are nicely spread along the lattice of the game. We also prove that a necessary condition for convergence of behavior to a mixed strategy Nash equilibrium is that the players consider arbitrarily long histories when forming their predictions.Journal of Economic LiteratureClassification Numbers: C72, D83.     

The Role of Absolute Continuity in “Merging of Opinions” and “Rational Learning”

D. Blackwell and L. Dubins (1962, Ann. Math. Statist.38, 882–886) showed that opinions merge when priors are absolutely continuous. E. Kalai and E. Lehrer (1993, Econometrica61, 1019–1045) use this result to show that players in a repeated game eventually play like a Nash equilibrium. We provide an alternative proof of merging of opinions that clarifies the role of absolute continuity while casting doubt on the relevance of the result. Persistent disagreement, the opposite of merging, allows the construction of a sequence of mutually favorable “bets.” By a law of large numbers, both agents are certain they will win these bets on average. This certain disagreement violates absolute continuity. Journal of Economic Literature Classification Numbers: C11, C69, C72, D83.     

A Noncooperative Analysis of Hotelling's Location Game

We study the location equilibrium in Hotelling's model of spatial competition. As d'Aspremontet al.have shown, with quadratic consumer transportation cost the two sellers will seek to move as far away from each other as possible. We show that the location game possesses an infinity of mixed strategy Nash equilibria. In these equilibria coordination failure invalidates the principle of “maximum differentiation” and firms may even locate at the same point.Journal of Economic LiteratureClassification Numbers: C72, D43, L11.     

Reference Points and Negative Reciprocity in Simple Sequential Games

We investigate experimentally whether preferences over an outcome depend on what other possible outcomes of the situation under consideration are, i.e., whether choices are “menu dependent.” In simple sequential games we analyze whether reactions to a certain benchmark outcome are influenced by changes in the payoffs of another outcome, not attainable at that time, called the “reference point.” Our data provide evidence that is favorable to the notion of menu dependence. Alterations of the reference point can lead to quantitatively significant changes in behavior at the benchmark outcome. The behavior we observe can be interpreted in terms of negative reciprocity. Journal of Economic Literature Classification Numbers: C91, C92, C72.     

Selective Acceptance and Inefficiency in a Two-Issue Complete Information Bargaining Game

This paper explores the effects of a “selective acceptance” rule on the outcome of two-issue negotiations. The alternating-offer game introduced here allows for the possibility that settlement may be reached on one issue while negotiation continues about the other. This model captures features of laws that are generally believed to increase efficiency. The analysis shows that if one issue is indivisible, there are inefficient subgame perfect equilibria with no Pareto-improving alternative equilibria. With opposing valuations, rapid communication guarantees inefficiency. These are unique examples of this strong form of inefficiency in an alternating-offer bargaining game with complete (and perfect) information. Journal of Economic Literature Classification Numbers: C72, J30.     

A solution to the random assignment problem on the full preference domain

We consider the problem of allocating a set of indivisible objects to agents in a fair and efficient manner. In a recent paper, Bogomolnaia and Moulin consider the case in which all agents have strict preferences, and propose the probabilistic serial (PS) mechanism; they define a new notion of efficiency, called ordinal efficiency, and prove that the probabilistic serial mechanism finds an envy-free ordinally efficient assignment. However, the restrictive assumption of strict preferences is critical to their algorithm. Our main contribution is an analogous algorithm for the full preference domain in which agents are allowed to be indifferent between objects. Our algorithm is based on a reinterpretation of the PS mechanism as an iterative algorithm to compute a “flow” in an associated network. In addition we show that on the full preference domain it is impossible for even a weak strategyproof mechanism to find a random assignment that is both ordinally efficient and envy-free.     

Altruism in Anonymous Dictator Games

We conduct double-anonymous dictator experiments to explore the role of altruism in motivating subjects' behavior. We vary the extent to which an anonymous recipient is deserving of aid and investigate its effect on the allocation of a fixed pie by student subjects. This is accomplished by including as treatments: (1) an anonymous student subject and (2) an established charity. We find that a significant increase in donations occurs when we increase the extent to which a donation goes to a recipient generally agreed to be “deserving.” We conclude that subjects are rational in the way they incorporate fairness into their decisions.Journal of Economic LiteratureClassification Numbers: A13, C91, D64.     

How Communication Improves Efficiency in Bargaining Games

We study a double auction with two-sided private information and preplay communication, for which Myerson and Satterthwaite (1983, J. Econ. Theory28, 265–281) showed that all equilibria are inefficient and the Chatterjee–Samuleson linear equilibrium is most efficient. Like several others, we find that players use communication to surpass equilibrium levels of efficiency, especially when the communication is face-to-face. Our main contribution is an analysis of how communication helps the parties achieve such high levels of efficiency. We find that when preplay communication is allowed, efficiency above equilibrium levels is a result of what we call “dyadic” strategies that allow the parties to coordinate on a single price that reflects both parties' valuations. Journal of Economic Literature Classification Numbers: C78, D82.     

Games of Manipulation in Marriage Problems

We analyze the “equilibrium” outcomes of thepreference revelation gamesinduced byPareto efficientandindividually rationalsolutions in the context ofmarriage problems. We employ a Nash equilibrium refinement which allows deviations by a set of permissible coalitions, and show that the set of equilibrium outcomes coincides with a variant of the core that allows blocking by only permissible coalitions,Journal of Economic LiteratureClassification Numbers: C71, C78, D71, D78.     

Unfolding Social Hierarchies

Consider a large population of finitely-lived agents organized into n different hierarchical levels. Every period, all those placed at each level are randomly matched to play a given symmetric game. Based on the resulting outcome, a ρ-fraction of agents who (within their own level) attain the highest payoffs are promoted upwards. On the other hand, newcomers replacing those who die every period enter at the lowest level and choose irreversibly the strategy to be played for the rest of their life. This choice is made, with some noise, by imitating one of the strategies adopted at the highest level.  In this setup, the unique long-run behavior of the system is fully characterized for the whole class of 2×2 coordination games and two alternative variations of the model. The results crucially depend on the key “institutional” parameters ρ and n. In particular, it is shown that inefficient behavior prevails in the long run (even when risk-dominated) if promotion is only mildly selective—high ρ—and the social system is quite hierarchical—large n. In a stylized manner, these parameter conditions may be viewed as reflecting a sort of institutional deficiency that impairs economic performance. Journal of Economic Literature Classification Numbers: C70, C72, C73, D72.     

Eliciting Preferences to Assign Positions and Compensation

We describe strategy-proof rules for economies where an agent is assigned a position (e.g., a job) plus some of a divisible good. For the 2-agent–2-position case we derive a robust characterization. For the multi-agent–position case, many “arbitrary” such rules exist, so we consider additional requirements. By also requiring coalitional strategy-proofness or nonbossiness, the range of a solution is restricted to the point that such rules are not more complex than those for the Shapley–Scarf housing model (no divisible good). Third, we show that essentially only constant solutions are immune to manipulations involving “bribes.” Finally, we demonstrate a conflict between efficiency and strategy-proofness. The results extend to models (without externalities) in which agents share positions. Journal of Economic Literature Classification Numbers: C72, D70.     

A theory of natural addiction

Economic theories of rational addiction aim to describe consumer behavior in the presence of habit-forming goods. We provide a biological foundation for this body of work by formally specifying conditions under which it is optimal to form a habit. We demonstrate the empirical validity of our thesis with an in-depth review and synthesis of the biomedical literature concerning the action of opiates in the mammalian brain and their effects on behavior. Our results lend credence to many of the unconventional behavioral assumptions employed by theories of rational addiction, including adjacent complementarity and the importance of cues, attention, and self-control in determining the behavior of addicts. We offer evidence for the special case of the opiates that “harmful” addiction is the manifestation of a mismatch between behavioral algorithms encoded in the human genome and the expanded menu of choices faced by consumers in the modern world.     

An interactive computer-based approach to aid group problem formulation

The size, cost, and complexity of quantitative modeling in the social and physical sciences demand that the modeler focus attention on premodeling phases of analysis, specifically on formulation and definition of “problems.” This is especially true in the “softer” or less “well-structured” problem areas of futures research and technology assessment. At this stage of modeling, a key factor is communication among modelers. This paper briefly discusses approaches to classifying and formulating problems that illustrate the role of communication in modeling. It then describes a computer-based communication system as one possible aid in the problem-formulation process.     

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.     

On the Existence of Stable Roommate Matchings

This paper identifies a condition called “no odd rings” that is sufficient for the existence of stable roommate matchings in the weak preferences case. It shows that the process of allowing randomly chosen blocking pairs to match converges to a stable roommate matching with probability one as long as there are no odd rings. This random-paths-to-stability result generalizes that of Roth and Vande Vate (1990, Econometrica58, 1475–1480) and may not hold if there are odd rings. The “no odd rings” condition can also be used to prove a number of other sufficient conditions that are more economically interpretable. Journal of Economic Literature Classification Numbers: C78, D71.