Heterogeneity as a coordination device

A model of directed search with a finite number of buyers and sellers is considered, where sellers compete in direct mechanisms. Buyer heterogeneity and Nash equilibrium results in perfect sorting. The restriction to complementary inputs, that the match value function Q is supermodular, in addition coordinates the sellers strategies. In that case, equilibrium implements positive assortative matching, which is efficient and consistent with the stable (cooperative equilibrium) outcome. This provides a non-cooperative and decentralizedsolution for the Assignment Game. Conversely, if buyers are identical, no such coordination is possible, and there is a continuum of equilibria, one of which exhibits price posting, another yields competition in auctions.

Cooperative games in strategic form

In this paper we view bargaining and cooperation as an interaction superimposed on a strategic form game. A multistage bargaining procedure for N players, the proposer commitment procedure, is presented. It is inspired by Nash s two-player variable-threat model; a key feature is the commitment to threats. We establish links to classical cooperative game theory solutions, such as the Shapley value in the transferable utility case. However, we show that even in standard pure exchange economies the traditional coalitional function may not be adequate when utilities are not transferable.

Quotient spaces of boundedly rational types

By identifying types whose low-order beliefs up to level li about the state of nature coincide, weobtain quotient type spaces that are typically smaller than the original ones, preserve basic topologicalproperties, and allow standard equilibrium analysis even under bounded reasoning. Our Bayesian Nash(li; l-i)-equilibria capture players inability to distinguish types belonging to the same equivalence class.The case with uncertainty about the vector of levels (li; l-i) is also analyzed. Two examples illustratethe constructions.

Bringing game theory to hypothesis testing: Establishing finite sample bounds on inference

Small sample properties are of fundamental interest when only limited data is avail-able. Exact inference is limited by constraints imposed by speci.c nonrandomizedtests and of course also by lack of more data. These e¤ects can be separated as we propose to evaluate a test by comparing its type II error to the minimal type II error among all tests for the given sample. Game theory is used to establish this minimal type II error, the associated randomized test is characterized as part of a Nash equilibrium of a .ctitious game against nature.We use this method to investigate sequential tests for the di¤erence between twomeans when outcomes are constrained to belong to a given bounded set. Tests ofinequality and of noninferiority are included. We .nd that inference in terms oftype II error based on a balanced sample cannot be improved by sequential sampling or even by observing counter factual evidence providing there is a reasonable gap between the hypotheses.

A simple adaptive procedure leading to correlated equilibrium

We propose a simple adaptive procedure for playing a game. In thisprocedure, players depart from their current play with probabilities thatare proportional to measures of regret for not having used other strategies(these measures are updated every period). It is shown that our adaptiveprocedure guaranties that with probability one, the sample distributionsof play converge to the set of correlated equilibria of the game. Tocompute these regret measures, a player needs to know his payoff functionand the history of play. We also offer a variation where every playerknows only his own realized payoff history (but not his payoff function).

On some geometry and equivalence classes of normal form games

Equivalence classes of normal form games are defined using the geometryof correspondences of standard equilibiurm concepts like correlated, Nash,and robust equilibrium or risk dominance and rationalizability. Resultingequivalence classes are fully characterized and compared across differentequilibrium concepts for 2 x 2 games. It is argued that the procedure canlead to broad and game-theoretically meaningful distinctions of games aswell as to alternative ways of viewing and testing equilibrium concepts.Larger games are also briefly considered.

The evolution of conventions under incomplete information

We formulate an evolutionary learning process in the spirit ofYoung (1993a) for games of incomplete information. The process involves trembles. For many games, if the amount of trembling is small, play will be in accordance with the games' (semi-strict) Bayesian equilibria most of the time. This supports the notion of Bayesian equilibrium. Further, often play will most of the time be in accordance with exactly one Bayesian equilibrium. This gives a selection among the Bayesian equilibria. For two specific games of economic interest wecharacterize this selection. The first is an extension to incomplete information of the prototype strategic conflict known as Chicken. The second is an incomplete information bilateral monopoly, which is also an extension to incompleteinformation of Nash's demand game, or a simple version ofthe so-called sealed bid double auction. For both gamesselection by evolutionary learning is in favor of Bayesianequilibria where some types of players fail to coordinate, such that the outcome is inefficient.

Implementation, elimination of weakly dominated strategies and evolutionary dynamics

This paper is concerned with the realism of mechanisms that implementsocial choice functions in the traditional sense. Will agents actually playthe equilibrium assumed by the analysis? As an example, we study theconvergence and stability properties of Sj\"ostr\"om's (1994) mechanism, onthe assumption that boundedly rational players find their way to equilibriumusing monotonic learning dynamics and also with fictitious play. Thismechanism implements most social choice functions in economic environmentsusing as a solution concept the iterated elimination of weakly dominatedstrategies (only one round of deletion of weakly dominated strategies isneeded). There are, however, many sets of Nash equilibria whose payoffs maybe very different from those desired by the social choice function. Withmonotonic dynamics we show that many equilibria in all the sets ofequilibria we describe are the limit points of trajectories that havecompletely mixed initial conditions. The initial conditions that lead tothese equilibria need not be very close to the limiting point. Furthermore,even if the dynamics converge to the ``right'' set of equilibria, it stillcan converge to quite a poor outcome in welfare terms. With fictitious play,if the agents have completely mixed prior beliefs, beliefs and play convergeto the outcome the planner wants to implement.

An axiomatization of the prekernel of nontransferable utility games

We characterize the prekernel of NTU games by means of consistency,converse consistency, and five axioms of the Nash type on bilateral problems.The intersection of the prekernel and the core is also characterized with thesame axioms over the class of games where the core is nonempty.

Equilibrium selection through incomplete information in coordination games: An experimental study

We perform an experiment on a pure coordination game with uncertaintyabout the payoffs. Our game is closely related to models that have beenused in many macroeconomic and financial applications to solve problemsof equilibrium indeterminacy. In our experiment each subject receives anoisy signal about the true payoffs. This game has a unique strategyprofile that survives the iterative deletion of strictly dominatedstrategies (thus a unique Nash equilibrium). The equilibrium outcomecoincides, on average, with the risk-dominant equilibrium outcome ofthe underlying coordination game. The behavior of the subjects convergesto the theoretical prediction after enough experience has been gained. The data (and the comments) suggest that subjects do not apply through"a priori" reasoning the iterated deletion of dominated strategies.Instead, they adapt to the responses of other players. Thus, the lengthof the learning phase clearly varies for the different signals. We alsotest behavior in a game without uncertainty as a benchmark case. The gamewith uncertainty is inspired by the "global" games of Carlsson and VanDamme (1993).

Endogenous bargaining power

We present a novel approach to N-person bargaining, based on the idea thatthe agreement reached in a negotiation is determined by how the directconflict resulting from disagreement would be resolved. Our basic buildingblock is the disagreement function, which maps each set of feasible outcomesinto a disagreement point. Using this function and a weak axiom basedon individual rationality we reach a unique solution: the agreement inthe shadow of conflict, ASC. This agreement may be construed as the limitof a sequence of partial agreements, each of which is reached as a functionof the parties relative power. We examine the connection between ASC andasymmetric Nash solutions. We show the connection between the power ofthe parties embodied in the ASC solution and the bias in the SWF thatwould select ASC as an asymmetric Nash solution.

Auctions of licences and market structure

This paper studies sequential auctions of licences to operate in amarket where those firms that obtain at least one licence then engage ina symmetric market game. I employ a new refinement of Nash equilibrium,the concept of {\sl Markovian recursively undominated equilibrium}.The unique solution satisfies the following properties: (i) when severalfirms own licences before the auction (incumbents), new entrants buylicences in each stage, and (ii) when there is no more than one incumbent,either the single firm preempts entry altogether or entry occurs inevery stage, depending on the parameter configuration.

A one-shot Prisoners’ Dilemma with procedural utility

This article introduces a model of rationality that combines procedural utility over actions with consequential utility over payoffs. It applies the model to the Prisoners Dilemma and shows that empirically observed cooperative behaviors can be rationally explained by a procedural utility for cooperation. The model characterizes the situations in which cooperation emerges as a Nash equilibrium. When rational individuals are not solely concerned by the consequences of their behavior but also care for the process by which these consequences are obtained, there is no one single rational solution to a Prisoners Dilemma. Rational behavior depends on the payoffs at stake and on the procedural utility of individuals. In this manner, this model of procedural utility reflects how ethical considerations, social norms or emotions can transform a game of consequences.

On p-beauty contest integer games

In this paper we provide a full characterization of the pure-strategyNash Equilibria for the p-Beauty Contest Game when we restrict player schoices to integer numbers. Opposed to the case of real number choices,equilibrium uniqueness may be lost depending on the value of p and thenumber of players: in particular, as p approaches 1 any symmetric profileconstitutes a Nash Equilibrium. We also show that any experimental p-BeautyContest Game can be associated to a game with the integer restriction andthus multiplicity of equilibria becomes an issue. Finally, we show thatin these games the iterated deletion of weakly dominated strategies maynot lead to a single outcome while the iterated best-reply process alwaysdoes (though the outcome obtained depends on the initial conditions).

A note on the convergence to competitive equilibria in economies with moral hazard

We examine the conditions under which competitive equilibria can beobtained as the limit, when the number of strategic traders getslarge, of Nash equilibria in economies with asymmetric informationon agents' effort and possibly imperfect observability of agents'trades. Convergence always occur when either effort is publiclyobserved (no matter what is the information available tointermediaries on agents' trades); or effort is private informationbut agents' trades are perfectly observed; or no information at allis available on agents' trades. On the other hand, when eachintermediary can observe its trades with an agent, but not theagent's trades with other intermediaries, the (Nash) equilibriawith strategic intermediaries do not converge to any of thecompetitive equilibria, for an open set of economies. The source ofthe difficulties for convergence is the combination of asymmetricinformation and the restrictions on the observability of tradeswhich prevent the formation of exclusive contractual relationshipsand generate barriers to entry in the markets for contracts.