Multi-issue Bargaining with Endogenous Agenda

The first part of this paper shows that in a noncooperative bargaining model with alternating offers and time preferences the timing of issues (the agenda) matters even if players become arbitrarily patient. This result raises the question of which agenda should come up endogenously when agents bargain over a set of unrelated issues. It is found that simultaneous bargaining over “packages” should be a prevailing phenomenon, but we also point to the possibility of multiple equilibria involving even considerable delay. Journal of Economic Literature Classification Number: C78.     

Implementation,Elimination of Weakly Dominated Strategies and Evolutionary Dynamics

This paper studies convergence and stability properties of T. Sjöström's (1994, Games Econom. Behav.6, 502–511) mechanism, under the assumption that boundedly rational players find their way to equilibrium using monotonic evolutionary dynamics and best-reply dynamics. This mechanism implements most social choice functions in economic environments using as a solution concept one round of deletion of weakly dominated strategies and one round of deletion of strictly dominated strategies. However, there are other sets of Nash equilibria, whose payoffs may be very different from those desired by the social choice function. With monotonic dynamics, all these sets of equilibria contain limit points of the evolutionary dynamics. Furthermore, even if the dynamics converge to the “right” set of equilibria (i.e., the one which contains the solution of the mechanism), it may converge to an equilibrium which is worse in welfare terms. In contrast with this result, any interior solution of the best-reply dynamics converges to the equilibrium whose outcome the planner desires. Journal of Economic Literature Classification Numbers: C72, D70, D78.     

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.     

Coordination need not be a problem

In a game of common interest there is one action vector that all players prefer to every other. Yet there may be multiple Pareto-ranked Nash equilibria in the game and the “coordination problem” refers to the fact that rational equilibrium play cannot rule out Pareto-dominated equilibria. In this paper, I prove that two elements — asynchronicity and a finite horizon — are sufficient to uniquely select the Pareto-dominant action vector (in subgame perfect equilibrium play). Asynchronicity may be exogenously specified by the rules of the game. Alternatively, in a game where players choose when to move, asynchronicity may emerge as an equilibrium move outcome.     

Some extensions of a claim of Aumann in an axiomatic model of knowledge

The paper begins by presenting an axiomatic model of simple and iterated knowledge. A formal definition of the intuitive notion of common knowledge is given and shown equivalent to previous characterizations. It is shown that agents have information partitions. The second part generalizes Aumann's (Ann. Statist.4 (1976), 1236–1239) well-known propositions about common knowledge between two rational agents of each other's probability assignments. It is shown that: common knowledge of decisions—if these are rational—implies a common decision for like-minded agents; and that a “dialogue” in decisions leads to a common decision. A “no-trade” theorem is given which includes trade under complete uncertainty.     

On Sustaining Cooperation without Public Observations

This paper examines a dynamic game in which each player only observes a private and imperfect signal on the actions played. Our main result is that in a repeated prisoner's dilemma where defections are irreversible (at least for a long enough period of time), patient enough players may achieve almost efficient outcomes. Dealing with models of imperfect private monitoring is difficult because (i) continuation games are games of incomplete information, hence they do not have the same structure as the original game. In particular, continuation equilibria are correlated equilibria. (ii) Players are typically uncertain about their opponents' past observations and actions, and they use their entire own private history to learn about these actions. As a result equilibrium strategies are in general nontrivial and increasingly complex functions of past observations. We bypass these difficulties by looking at correlated equilibria of the original game and find correlated equilibria in which the decision problem faced by each player remains the same over time. Journal of Economic Literature Classification Numbers: C72.     

Equilibrium play in matches: Binary Markov games

We study two-person extensive form games, or “matches,” in which the only possible outcomes (if the game terminates) are that one player or the other is declared the winner. The winner of the match is determined by the winning of points, in “point games.” We call these matches binary Markov games. We show that if a simple monotonicity condition is satisfied, then (a) it is a Nash equilibrium of the match for the players, at each point, to play a Nash equilibrium of the point game; (b) it is a minimax behavior strategy in the match for a player to play minimax in each point game; and (c) when the point games all have unique Nash equilibria, the only Nash equilibrium of the binary Markov game consists of minimax play at each point. An application to tennis is provided.     

The lifeboat problem

We study an all-pay contest with multiple identical prizes (“lifeboat seats”). Prizes are partitioned into subsets of prizes (“lifeboats”). Players play a two-stage game. First, each player chooses an element of the partition (“a lifeboat”). Then each player competes for a prize in the subset chosen (“a seat”). We characterize and compare the subgame perfect equilibria in which all players employ pure strategies or all players play identical mixed strategies in the first stage. The partitioning of prizes can lead to coordination failure when players employ nondegenerate mixed strategies. In these equilibria some rents are sheltered and rent dissipation is reduced.     

HELPING BEHAVIOR IN LARGE SOCIETIES

This article investigates how helping behavior can be sustained in large societies in the presence of agents who never help. I consider a game with many players who are anonymously and randomly matched every period in pairs. Within each match, one player may provide socially optimal but individually costly help to the other player. I introduce and characterize the class of “linear equilibria” in which, unlike equilibria used in the previous literature, there is help even in the presence of behavioral players. Such equilibria are close to a tit‐for‐tat strategy and feature smooth help dynamics when the society is large.     

A model of signed network formation with heterogeneous players

This paper proposes a model of formation of signed networks that comprise both positive (friendly/cooperative) and negative (antagonistic) social ties between players who differ intrinsically in strength. Friendships/alliances serve to increase one’s power over their intrinsic strength; in the determination of power it matters not how many allies one has, but who these allies are. The model proposed here is suited to any context where players derive power from friendships/alliances with stronger players and payoffs are extracted from less powerful enemies. The structure of ties across various types of players is studied in Nash equilibria along with a characterization of Nash equilibria under various parametric conditions.     

Partial exposure in large games

In this work we introduce the notion of partial exposure, in which the players of a simultaneous-move Bayesian game are exposed to the realized types and chosen actions of a subset of the other players. We show that in any large simultaneous-move game, each player has very little regret even after being partially exposed to other players. If players are given the opportunity to be exposed to others at the expense of a small decrease in utility, players will decline this opportunity, and the original Nash equilibria of the game will survive.     

JUST A BIG MISUNDERSTANDING? BIAS AND BAYESIAN AFFECTIVE POLARIZATION

I present a model of affective polarization—growth in hostility over time between two parties—via quasi-Bayesian inference. In the model, two agents repeatedly choose actions. Each choice is based on a balance of concerns for private interests and the social good. More weight is put on private interests when an agent's character is intrinsically more self-serving and when the other agent is believed to be more self-serving. Each agent Bayesian updates about the other's character, and dislikes the other more when she is perceived as more self-serving. I characterize the effects on growth in dislike of three biases: a prior bias against the other agent's character, the false consensus bias, and limited strategic thinking. Prior bias against the other's character remains constant or declines over time, and actions do not diverge. The other two biases cause actions to become more extreme over time and repeatedly be “worse” than expected, causing mutual growth in dislike, that is, affective polarization. The magnitude of dislike can become arbitrarily large—even when both players are arbitrarily “good” (unselfish). The results imply that seemingly irrelevant cognitive biases can be an important cause of the devolution of relationships, in politics and beyond, and that subtlety and unawareness of bias can be key factors driving the degree of polarization.     

Evolution and Mixed Strategies

Selten (1980, J. Theoret. Biol., 84, 93–101) showed that no mixed equilibria are evolutionarily stable when players can condition their strategies on their roles in a game. Alternatively, Harsanyi's (1973, Int. J. Game Theory, 2, 1–23) purification argument implies that all mixed equilibria are approximations of strict, and hence evolutionarily stable, equilibria of games with slightly perturbed payoffs. This paper reconciles these results: Approximations of mixed equilibria have high invasion barriers, and hence are likely to persist, when payoff perturbations are relatively important and role identification is relatively noisy. When payoff perturbations are unimportant and role identification is precise, approximations of mixed equilibria will have small invasion barriers and are unlikely to persist. Journal of Economic Literature Classification Numbers: C70, C78.     

PEER TRANSPARENCY IN TEAMS: DOES IT HELP OR HINDER INCENTIVES?*

In a joint project involving two players of a two‐round effort investment game with complementary efforts, transparency, by allowing players to observe each other’s efforts, achieves at least as much, and sometimes more, collective and individual efforts relative to a nontransparent environment. Without transparency multiple equilibria can arise, and transparency eliminates the inferior equilibria. When full cooperation arises only under transparency, it occurs gradually: No worker sinks in the maximum amount of effort in the first round, preferring instead to smooth out contributions over time. If the players’ efforts are substitutes, transparency makes no difference to equilibrium efforts.     

Generic 4 × 4 Two Person Games Have at Most 15 Nash Equilibria

The maximal generic number of Nash equilibria for two person games in which the two agents each have four pure strategies is shown to be 15. In contrast to Keiding (1997),Games Econ. Behav.21, 148–160, who arrives at this result by referring to the enumeration of Grünbaum and Sreedharan (1967),J. Combin. Theory2, 437–465, our argument is based on a collection of lemmas that constrain the set of equilibria. Several of these pertain to any common numberdof pure strategies for the two agents.Journal of Economic LiteratureClassification Number: C72.     

FOUR CHARACTERIZATIONS OF CONSTRAINED PARETO EFFICIENCY IN CONTINUUM ECONOMIES WITH WIDESPREAD EXTERNALITIES*

In continuum economies, widespread externalities are those over which each individual has negligible control. Nash-Walrasian equilibria with lump-sum transfers are defined, and their existence proved. They are then characterized by the property of “f-constrained Pareto efficiency” for finite coalitions. More general “private good” Nash-Walrasian equilibria are characterized as private-good constrained-Pareto efficient. Introducing complete Pigou taxes or subsidies leads to equilibria that are characterized by constrained efficiency and f-constrained efficiency for given levels of the widespread externalities. But full efficiency requires resolving the public-good problem of determining those aggregate externalities or, equivalently, of setting appropriate Pigou prices.     

Electoral competition with privately-informed candidates

This paper formulates and analyzes a general model of elections in which candidates receive private signals about voters' preferences prior to committing to political platforms. We fully characterize the unique pure-strategy equilibrium: After receiving her signal, each candidate locates at the median of the distribution of the median voter's location, conditional on the other candidate receiving the same signal. Sufficient conditions for the existence of pure strategy equilibrium are provided. Though the electoral game exhibits discontinuous payoffs for the candidates, we prove that mixed strategy equilibria exist generally, that equilibrium expected payoffs are continuous in the parameters of the model, and that mixed strategy equilibria are upper hemicontinuous. This allows us to study the robustness of the median voter theorem to private information: Pure strategy equilibria may fail to exist in models “close” to the Downsian model, but mixed strategy equilibria must, and they will be “close” to the Downsian equilibrium.     

Political system and economic efficiency: The east European context

Sections 1 and 2 reexamine the proposition about democratization of socialism as a factor of economic efficiency—in the light of the challenge contained in the article by Stanislaw Gomutka, “Economic Factors in the Democratization of Socialism and the Socialization of Capitalism” (J. Comp. Econ., Dec. 1977, 1, 4:389–406). The author takes issue with Gomulka's conclusions, which view democracy as of little relevance for economic efficiency under socialism. Dissident views on the link between democracy and efficiency are discussed. Section 3 goes beyond this controversy in an attempt to analyze the prospects and efficiency aspects of a limited change within the existing Soviet-type political system (“Kadarism”).     

The importance of higher-order beliefs to successful coordination

Beliefs about other players’ strategies are crucial in determining outcomes for coordination games. If players are to coordinate on an efficient equilibrium, they must believe that others will coordinate with them. In many settings there is uncertainty about beliefs as well as strategies. Do people consider these “higher-order” beliefs (beliefs about beliefs) when making coordination decisions? I design a modified stag hunt experiment that allows me to identify how these higher-order beliefs and uncertainty about higher-order beliefs matter for coordination. Players prefer to invest especially when they believe that others are “optimistic” that they will invest; but knowledge that others think them unlikely to invest does not cause players to behave differently than when they do not know what their partners think about them. Thus resolving uncertainty about beliefs can result in marked efficiency gains.     

Unmediated communication in games with complete and incomplete information

We study the effects of adding unmediated communication to static, finite games of complete and incomplete information. We characterize S^U(G), the set of outcomes of a game G, that are induced by sequential equilibria of cheap talk extensions. A cheap talk extension of G is an extensive-form game in which players communicate before playing G. A reliable mediator is not available and players exchange private or public messages that do not affect directly their payoffs. We first show that if G is a game of complete information with five or more players and rational parameters, then S^U(G) coincides with the set of correlated equilibria of G. Next, we demonstrate that if G is a game of incomplete information with at least five players, rational parameters and full support (i.e., all profiles of types have positive probability), then S^U(G) is equal to the set of communication equilibria of G.