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.     

Learning from private information in noisy repeated games

We study the perfect type-contingently public ex-post equilibrium (PTXE) of repeated games where players observe imperfect public signals of the actions played, and both the payoff functions and the map from actions to signal distributions depend on an unknown state. The PTXE payoffs when players are patient are determined by the solutions to a family of linear programming problems. Using this characterization, we develop conditions under which play can be as if the players have learned the state. We provide a sufficient condition for the folk theorem, and a characterization of the PTXE payoffs in games with a known monitoring structure.     

Decompositions and potentials for normal form games

A basic model of commitment is to convert a two-player game in strategic form to a “leadership game” with the same payoffs, where one player, the leader, commits to a strategy, to which the second player always chooses a best reply. This paper studies such leadership games for games with convex strategy sets. We apply them to mixed extensions of finite games, which we analyze completely, including nongeneric games. The main result is that leadership is advantageous in the sense that, as a set, the leader's payoffs in equilibrium are at least as high as his Nash and correlated equilibrium payoffs in the simultaneous game. We also consider leadership games with three or more players, where most conclusions no longer hold.     

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.     

Local equilibrium equivalence in probabilistic voting models

Electoral equilibria depend upon candidates' motivations. Maximization of expected vote share may not lead to the same behavior as maximization of the probability of winning the election. Accordingly, it is desirable to understand when electoral equilibria are insensitive to the choice of candidate motivations. This paper examines sufficient conditions for local equilibrium equivalence between expected vote share maximization and maximization of probability of victory in the spatial model of elections with probabilistic voters.     

Admissibility and common belief

The concept of ‘fully permissible sets’ is defined by an algorithm that eliminates strategy subsets. It is characterized as choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominates the latter on the set of all opponent strategies or on the union of the choice sets that are deemed possible for the opponent. The concept refines the Dekel–Fudenberg procedure and captures aspects of forward induction.     

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.     

The target projection dynamic

We study the target projection dynamic, a model of learning in normal form games. The dynamic is given a microeconomic foundation in terms of myopic optimization under control costs due to a certain status-quo bias. We establish a number of desirable properties of the dynamic: existence, uniqueness and continuity of solution trajectories, Nash stationarity, positive correlation with payoffs, and innovation. Sufficient conditions are provided under which strictly dominated strategies are wiped out. Finally, some stability results are provided for special classes of games.     

The value of public information in a Cournot duopoly

We derive alternative sufficient conditions for the value of public information to be either positive or negative in a Cournot duopoly where firms technology exhibits constant returns to scale.     

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.     

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.     

An implementation of the Owen value

We present an implementation of the Owen value (Owen, 1977, Essays in Mathematical Economics and Game Theory, pp. 76–88), inspired by the bidding mechanism introduced by Pérez-Castrillo and Wettstein (2001, J. Econ. Theory 100, 274–294). The idea is the following: first players of each coalition play the bidding mechanism trying to obtain the resources of the coalition. Later, players who obtained the resources play the bidding mechanism in order to share the surplus.     

A characterization of strategic complementarities

I characterize games for which there is an order on strategies such that the game has strategic complementarities. I prove that, with some qualifications, games with a unique equilibrium have complementarities if and only if Cournot best-response dynamics has no cycles; and that all games with multiple equilibria have complementarities. As applications of my results, I show that: (1) generic 2×2 games either have no pure-strategy equilibria, or have complementarities; (2) generic two-player finite ordinal potential games have complementarities.     

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.     

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.     

Bargaining under a deadline: evidence from the reverse ultimatum game

We study a “reverse” ultimatum game, in which proposers have multiple chances to offer responders a division of some fixed pie. The game ends if the responder accepts an offer, or if, following a rejection, the proposer decides not to make a better offer. The unique subgame perfect equilibrium gives the proposer the minimum possible payoff. Nevertheless, the experimental results are not too different from those of the standard ultimatum game, although proposers generally receive slightly less than half of the surplus.We use the reverse ultimatum game to study deadlines experimentally. With a deadline, the subgame perfect equilibrium prediction is that the proposer gets the entire surplus.Deadlines are used strategically to influence the outcome, and agreements are reached near the deadline. Strategic considerations are evident in the differences in observed behavior between the deadline and no deadline conditions, even though agreements are substantially less extreme than predicted by perfect equilibrium.     

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.     

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.     

Large deviations and multinomial probit choice

We consider a discrete choice model in which the payoffs to each of an agent?s n actions are subjected to the average of m i.i.d. shocks, and use tools from large deviations theory to characterize the rate of decay of the probability of choosing a given suboptimal action as m approaches infinity. Our model includes the multinomial probit model of Myatt and Wallace (2003) [5] as a special case. We show that their formula describing the rates of decay of choice probabilities is incorrect, provide the correct formula, and use our large deviations analysis to provide intuition for the difference between the two.