Learning to Learn, Pattern Recognition, and Nash Equilibrium

The paper studies a large class of bounded-rationality, probabilistic learning models on strategic-form games. The main assumption is that players “recognize” cyclic patterns in the observed history of play. The main result is convergence with probability one to a fixed pattern of pure strategy Nash equilibria, in a large class of “simple games” in which the pure equilibria are nicely spread along the lattice of the game. We also prove that a necessary condition for convergence of behavior to a mixed strategy Nash equilibrium is that the players consider arbitrarily long histories when forming their predictions.Journal of Economic LiteratureClassification Numbers: C72, D83.     

Auctions of Heterogeneous Objects

Simultaneous sealed bid auctions of heterogeneous objects are analyzed. Each bidder's reservation value for an object depends upon the other objects he obtains. Bidders' reservation values are common knowledge. In simultaneous first-price auctions, the set of Walrasian equilibrium allocations contains the set of pure strategy Nash equilibrium allocations which in turn contains the set of strict Walrasian equilibrium allocations. Hence, pure strategy Nash equilibria (when they exist) are efficient. Mixed strategy Nash equilibria may be inefficient. In simultaneous second-price auctions, any efficient allocation can be implemented as a pure strategy Nash equilibrium outcome if a Walrasian equilibrium exists.Journal of Economic LiteratureClassification Numbers: D44, D51.     

A note on asymmetric and mixed strategy equilibria in the search-theoretic model of fiat money

Summary. The simple search-theoretic model of fiat money has three symmetric Nash equilibria: all agents accept money with probability 1; all agents accept money with probability 0; and all agents accept money with probability y in (0,1). Here I construct an asymmetric pure strategy equilibrium, payoff-equivalent to the symmetric mixed strategy equilibrium, where a fraction N in (0,1) of agents always accept money and 1-N never accept money. Counter to what has been conjectured previously, I find N > y. I also introduce evolutionary dynamics, and show that the economy converges to monetary exchange iff the initial proportion of agents accepting money exceeds N. Received: September 10, 1997; revised version: April 24, 1998     

Reinterpreting mixed strategy equilibria: a unification of the classical and Bayesian views

We provide a new interpretation of mixed strategy equilibria that incorporates both von Neumann and Morgenstern's classical concealment role of mixing, as well as the more recent Bayesian view originating with Harsanyi. For any two-person game, G, we consider an incomplete information game, in which each player's type is the probability he assigns to the event that his mixed strategy in G is “found out” by his opponent. We show that, generically, any regular equilibrium of G can be approximated by an equilibrium of in which almost every type of each player is strictly optimizing. This leads us to interpret i's equilibrium mixed strategy in G as a combination of deliberate randomization by i together with uncertainty on j's part about which randomization i will employ. We also show that such randomization is not unusual: for example, i's randomization is nondegenerate whenever the support of an equilibrium contains cyclic best replies.     

Asymptotic expected number of Nash equilibria of two-player normal form games

The formula given by McLennan [The mean number of real roots of a multihomogeneous system of polynomial equations, Amer. J. Math. 124 (2002) 49–73] is applied to the mean number of Nash equilibria of random two-player normal form games in which the two players have M and N pure strategies respectively. Holding M fixed while N→∞, the expected number of Nash equilibria is approximately . Letting M=N→∞, the expected number of Nash equilibria is , where is a constant, and almost all equilibria have each player assigning positive probability to approximately 31.5915 percent of her pure strategies.     

Extensive Form Games with Uncertainty Averse Players

Nash equilibrium presumes that the beliefs of a player are represented by a probability measure. Motivated by the Ellsberg Paradox and relevant experimental findings demonstrating that this representation of beliefs may be unrealistic, this paper generalizes Nash equilibrium in finite extensive form games to allow for preferences conforming to the multiple priors model developed by Gilboa and Schmeidler [Journal of Mathematical Economics, 18 (1989), 141–153]. The implications of this generalization for strategy choices and welfare are studied. Journal of Economic Literature Classification Numbers: C72, D81.     

Congestion games with load-dependent failures: Identical resources

We define a new class of games, congestion games with load-dependent failures (CGLFs). In a CGLF each player can choose a subset of a set of available resources in order to try and perform his task. We assume that the resources are identical but that players' benefits from successful completion of their tasks may differ. Each resource is associated with a cost of use and a failure probability which are load-dependent. Although CGLFs in general do not have a pure strategy Nash equilibrium, we prove the existence of a pure strategy Nash equilibrium in every CGLF with nondecreasing cost functions. Moreover, we present a polynomial time algorithm for computing such an equilibrium.     

Iterated strict dominance in general games

We offer a definition of iterated elimination of strictly dominated strategies (IESDS^*) for games with (in)finite players, (non)compact strategy sets, and (dis)continuous payoff functions. IESDS^* is always a well-defined order independent procedure that can be used to solve Nash equilibrium in dominance-solvable games. We characterize IESDS^* by means of a “stability” criterion, and offer a sufficient and necessary epistemic condition for IESDS^*. We show by an example that IESDS^* may generate spurious Nash equilibria in the class of Reny's better-reply secure games. We provide sufficient/necessary conditions under which IESDS^* preserves the set of Nash equilibria.     

A general structure theorem for the Nash equilibrium correspondence

I consider n-person normal form games where the strategy set of each player is a non-empty compact convex subset of an Euclidean space, and the payoff function of player i is continuous in joint strategies and continuously differentiable and concave in the player i's strategy. No further restrictions (such as multilinearity of the payoff functions or the requirement that the strategy sets be polyhedral) are imposed. I demonstrate that the graph of the Nash equilibrium correspondence on this domain is homeomorphic to the space of games. This result generalizes a well-known structure theorem in [Kohlberg, E., Mertens, J.-F., 1986. On the strategic stability of equilibria. Econometrica 54, 1003–1037]. It is supplemented by an extension analogous to the unknottedness theorems in [Demichelis S., Germano, F., 2000. Some consequences of the unknottedness of the Walras correspondence. J. Math. Econ. 34, 537–545; Demichelis S., Germano, F., 2002. On (un)knots and dynamics in games. Games Econ. Behav. 41, 46–60]: the graph of the Nash equilibrium correspondence is ambient isotopic to a trivial copy of the space of games.     

Dominant strategy implementation in economic environments

We study dominant strategy implementation especially in economic environments. We first show that in general environments, strategy-proofness and quasi-strong-non-bossiness together are necessary and sufficient for dominant strategy implementation via the associated direct revelation mechanism. We next prove that in weak separable environments, strategy-proofness is sufficient for dominant strategy implementation, by using an augmented revelation mechanism similar to the one devised by Jackson, Palfrey, and Srivastava [Jackson, M.O., Palfrey, T.R., Srivastava, S., 1994. Undominated Nash implementation in bounded mechanisms. Games Econ. Behav. 6, 474–501]. Moreover, we focus on pure exchange economies without free disposal, and try to construct another augmented revelation mechanism that satisfies balancedness in and out of equilibrium, and which implements all strategy-proof social choice functions in dominant strategy equilibria.     

Games of Manipulation in Marriage Problems

We analyze the “equilibrium” outcomes of thepreference revelation gamesinduced byPareto efficientandindividually rationalsolutions in the context ofmarriage problems. We employ a Nash equilibrium refinement which allows deviations by a set of permissible coalitions, and show that the set of equilibrium outcomes coincides with a variant of the core that allows blocking by only permissible coalitions,Journal of Economic LiteratureClassification Numbers: C71, C78, D71, D78.     

Strong Equilibrium in Congestion Games

[6]introduced the class of congestion games and proved that they always possess a Nash equilibrium in pure strategies. Here we obtain conditions for the existence of a strong equilibrium in this class of games, as well as for the equivalence of Nash and strong equilibria. We also give conditions for uniqueness and for Pareto optimality of the Nash equilibrium. Except for a natural monotonicity assumption on the utilities, the conditions are expressed only in terms of the underlying congestion game form. It turns out that avoiding a certain type of bad configuration in the strategy spaces is essential to positive results.Journal of Economic LiteratureClassification Numbers: C71, C72, D62.     

Non-Additive Beliefs and Strategic Equilibria

This paper studies n-player games where players' beliefs about their opponents' behaviour are modelled as non-additive probabilities. The concept of an “equilibrium under uncertainty” which is introduced in this paper extends the equilibrium notion of Dow and Werlang (1994, J. Econom. Theory64, 305–324) to n-player games in strategic form. Existence of such an equilibrium is demonstrated under usual conditions. For low degrees of ambiguity, equilibria under uncertainty approximate Nash equilibria. At the other extreme, with a low degree of confidence, maximin equilibria appear. Finally, robustness against a lack of confidence may be viewed as a refinement for Nash equilibria. Journal of Economic Literature Classification Numbers: C72, D81.     

Nash equilibrium and party polarization in an electoral model with mixed motivations

We study the existence problem of Nash equilibrium as well as the patterns of equilibrium policy outcomes in an electoral competition model with mixed motivations. Each party maximizes a sum of party members’ expected utility and office rent. The inclusion of office rent renders the payoff of each party discontinuous. This makes it difficult to apply usually fixed point arguments to prove the existence of Nash equilibria. By using a recently developed concept, multiple restrictional security (MR‐security) we provide conditions under which a pure‐strategy Nash equilibrium exists within fairly general settings, and further the analysis by presenting conditions under which various patterns of policy choices, including polarization, arise in equilibrium.     

Existence and Uniqueness of Nash Equilibrium in Electoral Competition Games: The Hybrid Case

This paper analyzes the traditional unidimensional, two‐party electoral competition game when parties have mixed motivations, in the sense that they are interested in winning the election, but also in the policy implemented after the contest. In spite of having discontinuous payoffs, this game, referred to as the hybrid election game, is shown to be payoff secure and reciprocally upper semi‐continuous. Conditional payoffs, however, are not quasi‐concave. Hence, the existence of a pure strategy Nash equilibrium (psne ) is ensured only if parties have homogenous interests in power. In that case, an equilibrium not only exists, but it is also unique. Instead, if parties have heterogeneous motivations, depending upon the relationship between the electoral uncertainty, the aggregate opportunism, and its distribution across parties, a psne may or may not exist. The mixed extension, however, is always better reply secure. Therefore, a mixed strategy Nash equilibrium does indeed exist.     

Better-reply dynamics and global convergence to Nash equilibrium in aggregative games

We consider n-person games with quasi-concave payoffs that depend on a player's own action and the sum of all players' actions. We show that a discrete-time, stochastic process in which players move towards better replies—the better-reply dynamics—converges globally to a Nash equilibrium if actions are either strategic substitutes or strategic complements for all players around each Nash equilibrium that is asymptotically stable under a deterministic, adjusted best-reply dynamics. We present an example of a 2-person game with a unique equilibrium where the derivatives of the best-reply functions have different signs and the better-reply dynamics does not converge.     

Mixed-Strategy Nash Equilibrium Based upon Expected Utility and Quadratic Utility

The notion of a mixed-strategy Nash equilibrium suffers from three inherent difficulties. First, given the equilibrium strategies of other players, there are many best replies. Second, the equilibrium is unstable. Third, comparative statics results are counterintuitive. We demonstrate that these difficulties all have their origin in von Neumann and Morgenstern′s expected utility. In contrast, players with "quadratic utility" have unique best replies and the Nash equilibrium appears to yield intuitive comparative statics results. Journal of Economic Literature Classification Number: C72.     

On the evolutionary selection of sets of Nash equilibria

It is well established for evolutionary dynamics in asymmetric games that a pure strategy combination is asymptotically stable if and only if it is a strict Nash equilibrium. We use an extension of the notion of a strict Nash equilibrium to sets of strategy combinations called ‘strict equilibrium set’ and show the following. For a large class of evolutionary dynamics, including all monotone regular selection dynamics, every asymptotically stable set of rest points that contains a pure strategy combination in each of its connected components is a strict equilibrium set. A converse statement holds for two-person games, for convex sets and for the standard replicator dynamic.     

A Noncooperative Analysis of Hotelling's Location Game

We study the location equilibrium in Hotelling's model of spatial competition. As d'Aspremontet al.have shown, with quadratic consumer transportation cost the two sellers will seek to move as far away from each other as possible. We show that the location game possesses an infinity of mixed strategy Nash equilibria. In these equilibria coordination failure invalidates the principle of “maximum differentiation” and firms may even locate at the same point.Journal of Economic LiteratureClassification Numbers: C72, D43, L11.     

Nash equilibrium without mutual knowledge of rationality

Summary. In a Nash equilibrium, players' rationality is mutual knowledge. However, both intuition and experimental evidence suggest that players do not know for sure the rationality of opponents. This paper proposes a new equilibrium concept, cautious equilibrium, that generalizes Nash equilibrium in terms of preferences in two person strategic games. In a cautious equilibrium, players do not necessarily know the rationality of opponents, but they view rationality as infinitely more likely than irrationality. For suitable models of preference, cautious equilibrium predicts that a player might take a “cautious” strategy that is not a best response in any Nash equilibrium. Received: January 28, 1998; revised version October 2, 1998