Measuring strategic uncertainty in coordination games

This paper explores three aspects of strategic uncertainty: its relation to risk, predictability of behavior and subjective beliefs of players. In a laboratory experiment we measure subjects certainty equivalents for three coordination games and one lottery. Behavior in coordination games is related to risk aversion, experience seeking, and age.From the distribution of certainty equivalents we estimate probabilities for successful coordination in a wide range of games. For many games, success of coordination is predictable with a reasonable error rate. The best response to observed behavior is close to the global-game solution. Comparing choices in coordination games with revealed risk aversion, we estimate subjective probabilities for successful coordination. In games with a low coordination requirement, most subjects underestimate the probability of success. In games with a high coordination requirement, most subjects overestimate this probability. Estimating probabilistic decision models, we show that the quality of predictions can be improved when individual characteristics are taken into account. Subjects behavior is consistent with probabilistic beliefs about the aggregate outcome, but inconsistent with probabilistic beliefs about individual behavior.

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.

Multiple prisoner's dilemma games with (out) an outside option: An experimental study

Experiments in which subjects play simultaneously several finite prisoner's dilemma supergames with and without an outside optionreveal that: (i) subjects use probabilistic start and endeffect behaviour, (ii) the freedom to choose whether to play the prisoner's dilemma game enhances cooperation, (iii) if the payoff for simultaneous defection is negative, subjects' tendency to avoid losses leads them to cooperate; while this tendency makes them stick to mutual defection if its payoff is positive.

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.

Rational reasoning or adaptive behavior? Evidence from two-person beauty contest games

Many experiments have shown that human subjects do not necessarily behave in line with game theoretic assumptions and solution concepts. The reasons for this non-conformity are multiple. In this paper we study the argument whether a deviation from game theory is because subjects are rational, but doubt that others are rational as well, compared to the argument that subjects, in general, are boundedly rational themselves. To distinguish these two hypotheses, we study behavior in repeated 2-person and many-person Beauty-Contest-Games which are strategically different from one another. We analyze four different treatments and observe that convergence toward equilibrium is driven by learning through the information about the other player s choice and adaptation rather than self-initiated rational reasoning.

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).

Ambiguity in election games

We construct a model in which the ambiguity of candidates allows them toincrease the number of voters to whom they appeal when voters have intense preferences for one of the alternatives available. An ambiguous candidate may offer voters with different preferences the hope that their most preferred alternative will be implemented. We find conditions under which ambiguous strategies are chosen in equilibrium. These conditions include the case in which there is an outcome that is a majority winner against all other outcomes but is not the most preferred outcome for a majority of voters. It is shown that if the number of candidates or parties increases, ambiguity will not be possible in equilibrium, but a larger set of possible policies increases the chance that at least one candidate will choose to be ambiguous in equilibrium.

Generic finiteness of equilibrium payoffs for bimatrix games

It is shown that in any affine space of payoff matrices the equilibriumpayoffs of bimatrix games are generically finite.

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).

Causal assessment in finite extensive-form games

Two finite extensive-form games are empirically equivalent when theempirical distribution on action profiles generated by every behaviorstrategy in one can also be generated by an appropriately chosen behaviorstrategy in the other. This paper provides a characterization ofempirical equivalence. The central idea is to relate a game's informationstructure to the conditional independencies in the empirical distributionsit generates. We present a new analytical device, the influence opportunitydiagram of a game, describe how such a diagram is constructed for a givenextensive-form game, and demonstrate that it provides a complete summaryof the information needed to test empirical equivalence between two games.

Stochastic evolution of rules for playing normal form games

The evolution of boundedly rational rules for playing normal form games is studied within stationary environments ofstochastically changing games. Rules are viewed as algorithms prescribing strategies for the different normal formgames that arise. It is shown that many of the folk results of evolutionary game theory typically obtained witha fixed game and fixed strategies carry over to the present case. The results are also related to recent experimentson rules and games.

Social value orientation as a moral intuition: Decision-making in the dictator game

We studied the decision making process in the Dictator Game and showed that decisions are the result of a two-step process. In a first step, decision makers generate an automatic, intuitive proposal. Given sufficient motivation and cognitive resources, they adjust this in a second, more deliberated phase. In line with the social intuitionist model, we show that one s Social Value Orientation determines intuitive choice tendencies in the first step, and that this effect is mediated by the dictator s perceived interpersonal closeness with the receiver. Self-interested concerns subsequently leadto a reduction of donation size in step 2. Finally, we show that increasing interpersonal closeness can promote pro-social decision-making.

Max-convex decompositions for cooperative TU games

We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with non-negative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of modular games is a set of generators of the distributive lattice of all cooperative TU games. Finally, we characterize zero-monotonic games using a strong max-convex decomposition

A characterization of a new value and an existing value for cooperative games with levels structure of cooperation

En aquest treball presentem dues caracteritzacions de dos valors diferents en el marc dels jocs coalicionals amb cooperació restringida. Les restriccions són introduïdes com una seqüència finita de particions del conjunt del jugadors, de manera que cada una d'elles eés més grollera que l'anterior, formant així una estructura amb diferents nivells d'unions a priori.

Von Neumann-Morgenstern solution and convex descompositions of TU games

We study under which conditions the core of a game involved in a convex decomposition of another game turns out to be a stable set of the decomposed game. Some applications and numerical examples, including the remarkable Lucas¿ five player game with a unique stable set different from the core, are reckoning and analyzed.