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.     

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.     

Regret-based continuous-time dynamics

Regret-based dynamics have been introduced and studied in the context of discrete-time repeated play. Here we carry out the corresponding analysis in continuous time. We observe that, in contrast to (smooth) fictitious play or to evolutionary models, the appropriate state space for this analysis is the space of distributions on the product of the players' pure action spaces (rather than the product of their mixed action spaces). We obtain relatively simple proofs for some results known in the discrete case (related to ‘no-regret’ and correlated equilibria), and also a new result on two-person potential games (for this result we also provide a discrete-time proof).     

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.     

Nonmanipulable Bayesian testing

This paper considers the problem of testing an expert who makes probabilistic forecasts about the outcomes of a stochastic process. I show that, as long as uninformed experts do not learn the correct forecasts too quickly, a likelihood test can distinguish informed from uninformed experts with high prior probability. The test rejects informed experts on some data-generating processes; however, the set of such processes is topologically small. These results contrast sharply with many negative results in the literature.     

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.     

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.     

Aggregation of multiple prior opinions

Experts are asked to provide their advice in a situation of uncertainty. They adopt the decision maker?s utility function, but each has a potentially different set of prior probabilities, and so does the decision maker. The decision maker and the experts maximize the minimal expected utility with respect to their sets of priors. We show that a natural Pareto condition is equivalent to the existence of a set Λ of probability vectors over the experts, interpreted as possible allocations of weights to the experts, such that (i) the decision maker?s set of priors is precisely all the weighted-averages of priors, where an expert?s prior is taken from her set and the weight vector is taken from Λ; (ii) the decision maker?s valuation of an act is the minimal weighted valuation, over all weight vectors in Λ, of the experts? valuations.     

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.     

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.     

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.     

Informational size and incentive compatibility with aggregate uncertainty

In McLean and Postlewaite (Econometrica 56, 1992, p. 2421), we analyzed pure exchange economies with asymmetrically informed agents. We defined a notion of informational size and showed that, when the aggregate information of all agents resolves nearly all the uncertainty regarding the state of nature, the conflict between incentive compatibility and (ex post) efficiency can be made small if agents have sufficiently small informational size. This paper investigates the relationship between informational size and efficiency for the case in which nontrivial aggregate uncertainty is present, i.e., when significant uncertainty about the world persists even when the information of all agents is known.     

Error cascades in observational learning: An experiment on the Chinos game

The paper reports an experimental study based on a variant of the popular Chinos game, which is used as a simple but paradigmatic instance of observational learning. There are three players, arranged in sequence,each of which wins a fixed price if she manages to guess the total number of coins lying in everybody?s hands. Our evidence shows that, despite the remarkable frequency of equilibrium outcomes, deviations from optimal play are also significant. And when such deviations occur, we find that, for any given player position, the probability of a mistake is increasing in the probability of a mistake of her predecessors. This is what we call an error cascade, which we measure by evaluating the (heterogeneous) Quantal Response Equilibrium which better suits our data. We also check the robustness of our findings when we allow for belief heterogeneity by applying Kübler and Weizsäcker?s (2004) cognitive frame of limited depth of reasoning.     

The museum pass game and its value

We discuss a game in which service providers (e.g., museums) team up in offering a limited time access pass allowing unlimited usage of their services. In this game, a natural way to allocate the joint income from the sale of passes among the service providers is by using the Shapley value. We show that, for the particular game considered, the Shapley value takes a very intuitive and computationally simple form.     

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.     

How noise matters

Recent advances in evolutionary game theory have introduced noise into decisionmaking to select in favor of certain equilibria in coordination games. Noisy decisionmaking is justified on bounded rationality grounds, and consequently the sources of noise are left unmodelled. This methodological approach can only be successful if the results do not depend too much on the nature of the noise process. This paper investigates invariance to noise of these results, both for the random matching paradigm that has characterized much of the recent literature and for a larger class of two-strategy population games where payoffs may vary non-linearly with the distribution of strategies among the population. Several parametrizations of noise reduction are investigated. The results show that a symmetry property of the noise process and, in the case of non-linear payoffs, bounds on the asymmetry of the payoff functions suffice to preserve the known stochastic stability results.     

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.     

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.