LEXICOGRAPHIC ADDITIVITY FOR MULTI-ATTRIBUTE PREFERENCES ON FINITE SETS

Payoff dominance, a criterion for choosing between equilibrium points in games, is intuitively compelling, especially in matching games and other games of common interests, but it has not been justified from standard game-theoretic rationality assumptions. A psychological explanation of it is offered in terms of a form of reasoning that we call the Stackelberg heuristic in which players assume that their strategic thinking will be anticipated by their co-player(s). Two-person games are called Stackelberg-soluble if the players' strategies that maximize against their co-players' best replies intersect in a Nash equilibrium. Proofs are given that every game of common interests is Stackelberg-soluble, that a Stackelberg solution is always a payoff-dominant outcome, and that in every game with multiple Nash equilibria a Stackelberg solution is a payoff-dominant equilibrium point. It is argued that the Stackelberg heuristic may be justified by evidentialist reasoning.     

On the Inconsistency of Equilibrium Refinement

Consistency and optimality together with converse consistency provide an illuminating and novel characterization of the equilibrium concept (Peleg and Tijs, 1996). But (together with non-emptiness) they preclude refinements of the equilibrium notion and selection of a unique equilibrium (Norde et al., 1996). We suggest two escape routes: By generalizing the concept of strict equilibrium we question the practical relevance of the existence requirement for refinements. To allow for equilibrium selection we suggest more complex reduced games which capture the inclinations of ``players who already left'.     

On the Effect of Risk Aversion in Bimatrix Games

Nash equilibria with identical supports are compared for bimatrix games that are different with respect to the risk aversion of player 2. For equilibria in 2× 2-bimatrix games and for equilibria with efficient supports in coordination games it is established for which cases increased risk aversion of player 2 benefits or hurts player 2.     

Arbitrage,rationality, and equilibrium

No-arbitrage is the fundamental principle of economic rationality which unifies normative decision theory, game theory, and market theory. In economic environments where money is available as a medium of measurement and exchange, no-arbitrage is synonymous with subjective expected utility maximization in personal decisions, competitive equilibria in capital markets and exchange economies, and correlated equilibria in noncooperative games. The arbitrage principle directly characterizes rationality at the market level; the appearance of deliberate optimization by individual agents is a consequence of their adaptation to the market. Concepts of equilibrium behavior in games and markets can thus be reconciled with the ideas that individual rationality is bounded, that agents use evolutionarily-shaped decision rules rather than numerical optimization algorithms, and that personal probabilities and utilities are inseparable and to some extent indeterminate. Risk-neutral probability distributions, interpretable as products of probabilities and marginal utilities, play a central role as observable quantities in economic systems.     

CONGESTION MODELS AND WEIGHTED BAYESIAN POTENTIAL GAMES

Games associated with congestion situations à la Rosenthal (1973) have pure Nash equilibria. This result implicitly relies on the existence of a potential function. In this paper we provide a characterization of potential games in terms of coordination games and dummy games. Second, we extend Rosenthal's congestion model to an incomplete information setting, and show that the related Bayesian games are potential games and therefore have pure Bayesian equilibria.     

Five legitimate definitions of correlated equilibrium in games with incomplete information

Aumann's (1987) theorem shows that correlated equilibrium is an expression of Bayesian rationality. We extend this result to games with incomplete information.First, we rely on Harsanyi's (1967) model and represent the underlying multiperson decision problem as a fixed game with imperfect information. We survey four definitions of correlated equilibrium which have appeared in the literature. We show that these definitions are not equivalent to each other. We prove that one of them fits Aumann's framework; the agents normal form correlated equilibrium is an expression of Bayesian rationality in games with incomplete information.We also follow a universal Bayesian approach based on Mertens and Zamir's (1985) construction of the universal beliefs space. Hierarchies of beliefs over independent variables (states of nature) and dependent variables (actions) are then constructed simultaneously. We establish that the universal set of Bayesian solutions satisfies another extension of Aumann's theorem.We get the following corollary: once the types of the players are not fixed by the model, the various definitions of correlated equilibrium previously considered are equivalent.     

Indefinitely repeated games: A response to Carroll

In a recent volume of this journal John Carroll argued that there exist only uncooperative equilibria in indefinitely repeated prisoner's dilemma games. We show that this claim depends on modeling such games as finitely but indefinitely repeated games, which reduce simply to finitely repeated games. We propose an alternative general model of probabilistically indefinitely repeated games, and discuss the appropriateness of each of these models of indefinitely repeated games.     

Markov interactions in a class of dynamic games

This paper contributes to the understanding of economic strategic behaviors in inter-temporal settings. Comparing the MPE and the OLNE of a widely used class of differential games it is shown: (i) what qualifications on behaviors a markov (dynamic) information structure brings about compared with an open-loop (static) information structure, (ii) what is the reason leading to intensified or reduced competition between the agents in the long run. It depends on whether agents’ interactions are characterized by markov substitutability or markov complementarity, which can be seen as dynamic translations of the ideas of strategic substitutability and strategic complementarity (Bulow et al. 1985, Journal of Political Economy 93:488–511). In addition, an important practical contribution of the paper for modelers is to show that these results can be directly deduced from the payoff structure, with no need to compute equilibria first. I dedicate this paper to Philippe Michel, who introduced me to the literature on differential games.     

Focal points in pure coordination games: An experimental investigation

This paper reports an experimental investigation of the hypothesis that in coordination games, players draw on shared concepts of salience to identify focal points on which they can coordinate. The experiment involves games in which equilibria can be distinguished from one another only in terms of the way strategies are labelled. The games are designed to test a number of specific hypotheses about the determinants of salience. These hypotheses are generally confirmed by the results of the experiment.     

Instrumental rationality and cognitive rationality

Beside instrumental rationality, concerned with consistency between available means and pursued objectives, cognitive rationality, concerned with consistency between current beliefs and detained information, is nowadays bursting in economic theory. For an individual decision, the two notions are expressed structurally in similar forms, but they heavily interact in the deliberation process, especially when the agent is searching relevant information on his environment and his own determiners. In a game framework, the players' representations are formalized in a more and more sophisticated way, and are closely interwoven with their preferences in contemporary equilibrium notions as well as in selection between corresponding equilibrium points.     

A theory of forward induction in finitely repeated games

A forward induction solution for finitely repeated games with complete information is developed. This notion is motivated in terms of its implications on the way deviations affect the opponents' expectations about the future behavior of the deviating player. We argue that the inability of the notion of perfect equilibrium to take account of forward induction is a key factor responsible for a number of difficulties encountered in the use of perfect equilibria in repeated games. It is then shown that the solution proposed in this paper remedies some of these problems in the study of three important classes of repeated games: (i) finitely repeated coordination games; (ii) repeated games where one long-term player plays a sequence of short-term players; (iii) repeated battle of the sexes games.     

Two-Speed Evolution of Strategies and Preferences In Symmetric Games

Agents in a large population are randomly matched to play a certain game, payoffs in which represent fitness. Agents may have preferences that are different from fitness. They learn strategies according to their preferences, and evolution changes the preference distribution in the population according to fitness. When agents know the preferences of the opponent in a match, only efficient symmetric strategy profiles of the fitness game can be stable. When agents do not know the preferences of the opponent, only Nash equilibria of the fitness game can be stable. For 2 × 2 symmetric games I characterize preferences that are stable.Jel Codes: C72, A13     

A unified approach to restricted games

There have been two main lines in the literature on restricted games: the first line was started by Myerson (1977) that studied graph-restricted games an the second one was initiated by Faigle (1989). The present paper provides a unified way to look on the literature and establishes connections between the two different lines on restricted games. The strength and advantages of this unified approach becomes clear in the study of the inheritance of the convexity from the game to the restricted game where an interesting result by Nouweland and Borm (1991) on the convexity of graph-restricted games is turned into a direct consequence of the corresponding result by Faigle (1989), by means of this relation. This revised version was published online in June 2006 with corrections to the Cover Date.     

Generalized externality games

Externality games are studied in Grafe et al. (1998, Math. Methods Op. Res. 48, 71). We define a generalization of this class of games and show, using the methodology in Izquierdo and Rafels (1996, 2001, Working paper, Univ Barcelona; Games Econ. Behav. 36, 174), some properties of the new class of generalized externality games. They include, among others, the algebraic structure of the game, convexity, and their implications for the study of cooperative solutions. Also the proportional rule is characterized for this class of games.     

An axiomatic analysis of the Nash equilibrium concept

The purpose of this paper is to analyze axiomatically the Nash equilibrium concept. The class of games under study is a (relatively large) subclass of n-person normal form games. Solutions are correspondences which associate to each game a non empty set of strategy vectors of this game. It is shown that if a solution satisfies the axioms Independence of irrelevant alternatives (IIA) and Individual rationality (IR), then all the strategy vectors in this solution are Nash equilibria. This result holds good also if IR is replaced by Strong individual monotonicity (SIM) or Weak principle of fair compromise (WPFC).     

Maximin play in completely mixed strategic games

Since the seminal paper of Nash (Proc Natl Acad Sci USA 36:48–49, 1950) game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. In a recent paper of Pruzhansky (Int J Game Theory 40:351–365, 2011) it was shown that under fairy general conditions maximin strategies in completely mixed games can guarantee the same expected payoff as completely mixed Nash equilibrium strategies. Based on this finding, the current paper argues that maximin strategies have important properties. For instance, maximin strategies may refine Nash equilibria in subjective mixed strategies. Further, Bayesian rationality of the players may favor maximin strategies more often than Nash equilibrium strategies. The paper concludes with several suggestions for further experimental research that may shed more light on whether maximin behavior can explain reality better than Nash equilibrium.     

Binary 2 × 2 games

The 2 × 2 game is the simplest interactive decision model that portrays concerned decision makers with genuine choices. There are two players, each of whom must choose one of two strategies, so that there are four possible outcomes. Binary 2 × 2 games are 2 × 2 games with no restrictions on the players' preference relations over the outcomes. They therefore generalize the strict ordinal 2 × 2 games and the ordinal 2 × 2 games, classes which have already been studied extensively. This paper enumerates the strategically distinct binary 2 × 2 games. It also identifies important subsets defined by the number of pure Nash equilibria and the occurrence of dominant strategies.     

Game Trees For Decision Analysis

Game trees (or extensive-form games) were first defined by von Neumann and Morgenstern in 1944. In this paper we examine the use of game trees for representing Bayesian decision problems. We propose a method for solving game trees using local computation. This method is a special case of a method due to Wilson for computing equilibria in 2-person games. Game trees differ from decision trees in the representations of information constraints and uncertainty. We compare the game tree representation and solution technique with other techniques for decision analysis such as decision trees, influence diagrams, and valuation networks.     

Equilibria for far-sighted players

A new equilibrium concept for non-cooperative games, based on the assumptions that players are rational and far-sighted, is examined. An outcome is extended non-myopically (XNM) stable for a player if that player is assured that no movecountermove sequence he could initiate by departing unilaterally from that outcome would benefit him. The extended non-myopic (XNM) equilibria of a game, the outcomes which are XNM stable for each player, therefore model permanent (enduring) equilibria in an ongoing conflict.Algorithms for the identification of XNM equilibria in a 2 × 2 game are presented. The XNM concepts are then applied to three special classes of games (no-conflict games, games of complete opposition, and strict ordinal games) to compare their predictions of long-term stability with the known properties of games in these classes.Research supported by Natural Sciences and Engineering Research Council of Canada Grant No. A8974.     

Long-Term Behavior in the Theory of Moves

This paper proposes a revised Theory of Moves (TOM) to analyze matrix games between two players when payoffs are given as ordinals. The games are analyzed when a given player i must make the first move, when there is a finite limit n on the total number of moves, and when the game starts at a given initial state S. Games end when either both players pass in succession or else a total of n moves have been made. Studies are made of the influence of i, n, and S on the outcomes. It is proved that these outcomes ultimately become periodic in n and therefore exhibit long-term predictable behavior. Efficient algorithms are given to calculate these ultimate outcomes by computer. Frequently the ultimate outcomes are independent of i, S, and n when n is sufficiently large; in this situation this common ultimate outcome is proved to be Pareto-optimal. The use of ultimate outcomes gives rise to a concept of stable points, which are analogous to Nash equilibria but consider long-term effects. If the initial state is a stable point, then no player has an incentive to move from that state, under the assumption that any initial move could be followed by a long series of moves and countermoves. The concept may be broadened to that of a stable set. It is proved that every game has a minimal stable set, and any two distinct minimal stable sets are disjoint. Comparisons are made with the results of standard TOM.