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.     

Transferable utility games with uncertainty

We introduce the concept of a TUU-game, a transferable utility game with uncertainty. In a TUU-game there is uncertainty regarding the payoffs of coalitions. One out of a finite number of states of nature materializes and conditional on the state, the players are involved in a particular transferable utility game. We consider the case without ex ante commitment possibilities and propose the Weak Sequential Core as a solution concept. We characterize the Weak Sequential Core and show that it is non-empty if all ex post TU-games are convex.     

Separating the Hawks from the Doves: Evidence from continuous time laboratory games

Human players in our laboratory experiment received flow payoffs over 120 seconds each period from a standard Hawk–Dove bimatrix game played in continuous time. Play converged closely to the symmetric mixed Nash equilibrium under a one-population matching protocol. When the same players were matched in a two-population protocol with the same bimatrix, they showed clear movement towards an asymmetric (and very inequitable) pure Nash equilibrium of the game. These findings support distinctive predictions of evolutionary game theory.     

Advice and behavior in intergenerational ultimatum games: An experimental approach

In the real world, when people play a game, they often receive advice from those that have played it before them. Such advice can facilitate the creation of a convention of behavior. This paper studies the impact of advice on the behavior subjects who engage in a non-overlapping generational Ultimatum game where after a subject plays he is replaced by another subject to whom he can offer advice.Our results document the fact that allowing advice fosters the creation of a convention of behavior in Ultimatum games. In addition, by reading the advice offered we conclude that arguments of fairness are rarely used to justify the offers of Senders but are relied upon to justify rejections by Receivers.     

Learning to play Bayesian games

This paper discusses the implications of learning theory for the analysis of games with a move by Nature. One goal is to illuminate the issues that arise when modeling situations where players are learning about the distribution of Nature's move as well as learning about the opponents' strategies. A second goal is to argue that quite restrictive assumptions are necessary to justify the concept of Nash equilibrium without a common prior as a steady state of a learning process.     

On the folk theorem with one-dimensional payoffs and different discount factors

Proving the folk theorem in a game with three or more players usually requires imposing restrictions on the dimensionality of the stage-game payoffs. Fudenberg and Maskin (1986) assume full dimensionality of payoffs, while Abreu et al. (1994) assume the weaker NEU condition (“nonequivalent utilities”). In this note, we consider a class of n-player games where each player receives the same stage-game payoff, either zero or one. The stage-game payoffs therefore constitute a one-dimensional set, violating NEU. We show that if all players have different discount factors, then for discount factors sufficiently close to one, any strictly individually rational payoff profile can be obtained as the outcome of a subgame-perfect equilibrium with public correlation.     

Core-stable rings in auctions with independent private values

We propose a semi-cooperative game theoretic approach to check whether a given coalition is stable in a Bayesian game with independent private values. The ex ante expected utilities of coalitions, at an incentive compatible (noncooperative) coalitional equilibrium, describe a (cooperative) partition form game. A coalition is core-stable if the core of a suitable characteristic function, derived from the partition form game, is not empty. As an application, we study collusion in auctions in which the bidders? final utility possibly depends on the winner?s identity. We show that such direct externalities offer a possible explanation for cartels? structures (not) observed in practice.     

Nonminimal product differentiation as a bargaining outcome

It is well known that in a duopoly model of product choice with quadratic transportation cost, the firms locate at the extreme endpoints of the market. Jehiel (1992, Int. J. Ind. Organ, 10, 633–641) has examined this model in an infinite horizon setting where in the initial period the firms choose location and in subsequent periods charge the Nash bargaining solution prices. Then, in the unique equilibrium both firms locate at the center of the market. This paper examines the case when the firms instead charge the prices determined by either the egalitarian bargaining solution or the Kalai–Smorodinski bargaining solution. It is shown that central agglomeration is an equilibrium. Furthermore, there is a continuum of symmetric equilibria in addition where the firms locate apart from each other. So the products are not necessarily minimally differentiated. Thus different bargaining solutions provide quite different outcomes.     

Coalitional bargaining games with random proposers: Theory and application

We consider a non-cooperative coalitional bargaining game with random proposers in a general situation for which players differ in recognition probability and time preference. We characterize an efficient equilibrium as the generalized Nash bargaining solution that belongs to the core. The model is applied to wage bargaining between an employer and multiple workers. Although involuntary unemployment may occur in equilibrium, full employment emerges as players become sufficiently patient.     

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.     

A Blotto game with multi-dimensional incomplete information

We examine a multi-dimensional incomplete information Colonel Blotto game in which each player’s n-tuple of battlefield valuations is drawn from a common n-variate joint distribution function that is uniform on the non-negative orthant of the surface of a sphere.     

The dynamic instability of dispersed price equilibria

We adopt an evolutionary framework to explain price dispersion as a time varying phenomenon. By developing a finite strategy analogue of the Burdett and Judd (1983) price dispersion model, we show that all dispersed price equilibria are unstable under the class of perturbed best response dynamics. Instead, numerical simulations using the logit dynamic show that price dispersion manifests itself as a limit cycle. We verify that limit cycles persist even when the finite strategy model approaches the original continuous strategy model. For a particularly simple case of the model, we prove the existence of a limit cycle.     

Stochastic evolutionary selection in finite populations

We primarily focus on a wide range of stochastic evolutionary game dynamics between two strategies which are characterized by a condition we call monotonicity: the sign of the difference between the probabilities of increasing and decreasing an A-individual completely depends on the difference of payoffs based on different strategies. When mutations are excluded, we provide sufficient conditions for selection to favor one strategy over the other and necessary conditions for selection to favor or oppose change, respectively. Moreover, we discuss which strategy will be favored in case of rare mutations and give a simple rule to determine evolutionary selection of strategies for large populations under some specific stochastic mutation–selection dynamics.     

Aggregate information cascades

We introduce a new model of aggregate information cascades where only one of two possible actions is observable to others. Agents make a binary decision in sequence. The order is random and agents are not aware of their own position in the sequence. When called upon, they are only informed about the total number of others who have chosen the observable action before them. This informational structure arises naturally in many applications. Our most important result is that only one type of cascade arises in equilibrium, the aggregate cascade on the observable action. A cascade on the unobservable action never arises.     

Evolutionary selection of ‘chivalrous’ conventions in coordination games without common expectations

We study an evolutionary game-theoretic model where players have to choose within a predetermined set of mixed strategies in a coordination game. Players are of two different kinds, male and female. No common expectations assumption is made; players tend therefore to adopt the strategy that yields larger than average expected payoffs for their kind. In this framework, every stable stationary point of the population dynamics can be interpreted as the emergence of a particular convention. A classification of the possible conventions is provided; conditions for their emergence are determined.     

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.     

Non-cooperative solutions for estate division problems

In an estate division problem an estate has to be divided among several players whose total entitlement to the estate exceeds its size. This paper extends the non-cooperative approach through a claim game, as initiated by O?Neill (1982), by allowing players to put multiple claims on the same part of the estate, and by considering the case where individual entitlements may exceed the estate. A full characterization of the set of Nash equilibria of the claim game is obtained both for restricted estate division problems, where individual entitlements do not exceed the estate, and for the general case. Variations on the claim game are considered, which result in proportional division in equilibrium.     

The weak core of simple games with ordinal preferences: implementation in Nash equilibrium

In a simple game, coalitions belonging to a given class are “absolutely powerful” while others have no power. We attempt to make this distinction operational. Toward this end, we propose two axioms on social choice correspondences, Strong Non-Discrimination and Exclusion. Strong Non-Discrimination describes circumstances under which certain coalitions, the losing coalitions, have no influence over social choice. Exclusion requires that there are situations in which certain coalitions, the winning coalitions, can exercise their power. We show that the weak core correspondence is the minimal correspondence satisfying Maskin Monotonicity and Strong Non-Discrimination. We also show that the weak core is the unique correspondence satisfying Nash implementability, Strong Non-Discrimination, and Exclusion.