Competitive behavior in market games: Evidence and theory

We explore whether competitive outcomes arise in an experimental implementation of a market game, introduced by Shubik (1973) [21]. Market games obtain Pareto inferior (strict) Nash equilibria, in which some or possibly all markets are closed. We find that subjects do not coordinate on autarkic Nash equilibria, but favor more efficient Nash equilibria in which all markets are open. As the number of subjects participating in the market game increases, the Nash equilibrium they achieve approximates the associated competitive equilibrium of the underlying economy. Motivated by these findings, we provide a theoretical argument for why evolutionary forces can lead to competitive outcomes in market games.     

A three way equivalence

In view of the well known core equivalence results in atomless economies, coincidence of market game equilibrium allocations with competitive allocations is tantamount to a three way equivalence between market game mechanisms, competitive equilibria and the core. Based on this idea we study equilibrium refinements of market games, which allow us to use the core equivalence machinery in order to provide an exact market game characterization of competitive equilibria.     

Bilateral oligopoly and quantity competition

Bilateral oligopoly is a market game with two commodities, allowing strategic behavior on both sides of the market. When the number of buyers is large, bilateral oligopoly approximates a game of quantity competition played by sellers. We present examples which show that this is not typically a Cournot game. Rather, we introduce an alternative game of quantity competition (the market share game) and, appealing to results in the literature on contests, show that this yields the same equilibria as the many-buyer limit of bilateral oligopoly, under standard assumptions on costs and preferences. We also show that the market share and Cournot games have the same equilibria if and only if the price elasticity of the latter is one and investigate the differences in equilibria otherwise. These results lead to necessary and sufficient conditions for the Cournot game to be a good approximation to bilateral oligopoly with many buyers and to an ordering of total output when they are not satisfied.     

Evolutionary Stability of Pure-Strategy Equilibria in Finite Games

Sufficient conditions for pure-strategy Nash equilibria of finite games to be (Lyapunov) stable under a large class of evolutionary dynamics, the regular monotonic selection dynamics, are discussed. In particular, it is shown that in almost all finite extensive-form games, all the pure-strategy equilibria are stable. In such games, all mixed-strategy equilibria close to pure-strategy equilibria are also stable.Journal of Economic LiteratureClassification Numbers: C70, C72.     

Delay and information aggregation in stopping games with private information

We consider equilibrium timing decisions in a model with a large number of players and informational externalities. The players have private information about a common payoff parameter that determines the optimal time to invest. They learn from each other in real time by observing past investment decisions. We develop new methods of analysis for such large games, and we give a full characterization of symmetric equilibria. We show that the equilibrium statistical inferences are based on an exponential learning model. Although the beliefs converge to truth, learning takes place too late. Ex-ante welfare is strictly between that without observational learning and that with full information.     

Nearly compact and continuous normal form games: characterizations and equilibrium existence

Normal form games are nearly compact and continuous (NCC) if they can be understood as games played on strategy spaces that are dense subsets of the strategy spaces of larger compact games with jointly continuous payoffs. There are intrinsic algebraic, measure theoretic, functional analysis, and finite approximability characterizations of NCC games. NCC games have finitely additive equilibria, and all their finitely additive equilibria are equivalent to countably additive equilibria on metric compactifications. The equilibrium set of an NCC game depends upper hemicontinuously on the specification of the game and contains only the limits of approximate equilibria of approximate games.     

Symmetry-breaking in two-player games via strategic substitutes and diagonal nonconcavity: A synthesis

This paper is an attempt to develop a unified approach to symmetry-breaking in strategic models arising in industrial organization by constructing two general classes of two-player symmetric games that always possess only asymmetric pure-strategy Nash equilibria. These classes of games are characterized in some abstract sense by two general properties: payoff nonconcavities and some form of strategic substitutability. Our framework relies on easily verified assumptions on the primitives of the game, and relies on the theory of supermodular games. The underlying natural assumptions are satisfied in a number of two-stage models with an investment decision preceding product market competition. To illustrate the generality and wide scope for application of our approach, we present some existing models dealing with R&D, capacity expansion and information provision, which motivated this study.     

Robustness of equilibria in anonymous local games

This paper studies the robustness of symmetric equilibria in anonymous local games to perturbations of prior beliefs. Two priors are strategically close on a class of games if players receive similar expected payoffs in equilibrium under the priors, for any game in that class. I show that if the structure of payoff interdependencies is sparse in a well-defined sense, the conditions for strategic proximity in anonymous local games are strictly weaker than the conditions for general Bayesian games of Kajii and Morris (1998) [11] when attention is restricted to symmetric equilibria. Hence, by exploiting the properties of anonymous local games, it is possible to obtain stronger robustness results for this class.     

Sequential equilibrium in monotone games: A theory-based analysis of experimental data

A monotone game is an extensive-form game with complete information, simultaneous moves and an irreversibility structure on strategies. It captures a variety of situations in which players make partial commitments and allows us to characterize conditions under which equilibria result in socially desirable outcomes. However, since the game has many equilibrium outcomes, the theory lacks predictive power. To produce stronger predictions, one can restrict attention to the set of sequential equilibria, or Markov equilibria, or symmetric equilibria, or pure-strategy equilibria. This paper explores the relationship between equilibrium behavior in a class of monotone games, namely voluntary contribution games, and the behavior of human subjects in an experimental setting. Several key features of the symmetric Markov perfect equilibrium (SMPE) are consistent with the data. To judge how well the SMPE fits the data, we estimate a model of Quantal Response Equilibrium (QRE) [R. McKelvey, T. Palfrey, Quantal response equilibria for normal form games, Games Econ. Behav. 10 (1995) 6-38; R. McKelvey, T. Palfrey, Quantal response equilibria for extensive form games, Exp. Econ. 1 (1998) 9-41] and find that the decision rules of the QRE model are qualitatively very similar to the empirical choice probabilities.     

Markov perfect Nash equilibria in models with a single capital stock

Many economic problems can be formulated as dynamic games in which strategically interacting agents choose actions that determine the current and future levels of a single capital stock. We study necessary as well as sufficient conditions that allow us to characterise Markov perfect Nash equilibria for these games. These conditions can be translated into an auxiliary system of ordinary differential equations that helps us to explore stability, continuity and differentiability of these equilibria. The techniques are used to derive detailed properties of Markov perfect Nash equilibria for several games including voluntary investment in a public capital stock, the inter-temporal consumption of a reproductive asset and the pollution of a shallow lake.     

On ‘Informationally Robust Equilibria’ for Bimatrix Games

Informationally robust equilibria (IRE) are introduced in Robson (Games Econ Behav 7: 233–245, 1994) as a refinement of Nash equilibria for strategic games. Such equilibria are limits of a sequence of (subgame perfect) Nash equilibria in perturbed games where with small probability information about the strategic behavior is revealed to other players (information leakage). Focusing on bimatrix games, we consider a type of informationally robust equilibria and derive a number of properties they form a non-empty and closed subset of the Nash equilibria. Moreover, IRE is a strict concept in the sense that the IRE are independent of the exact sequence of probabilities with which information is leaked. The set of IRE, like the set of Nash equilibria, is the finite union of polytopes. In potential games, there is an IRE in pure strategies. In zero-sum games, the set of IRE has a product structure and its elements can be computed efficiently by using linear programming. We also discuss extensions to games with infinite strategy spaces and more than two players. The authors would like to thank Marieke Quant for her helpful comments.     

Equilibria in large games with continuous procedures

We study existence of equilibria in large games where players use boundedly rational procedures. The equilibria are different from Nash equilibria; the difference persists even when players use procedures for which the observations gathered in any period are used to evaluate the payoff from different actions.     

Market Games in Large Economies with a Finite Number of Types

We study market games derived from an exchange economy with a continuum of agents, each having one of finitely many possible types. The type of agent determines his initial endowment and utility function. It is shown that, unlike the well-known Shapley–Shubik theorem on market games (Shapley and Shubik in J Econ Theory 1:9–25, 1969), there might be a (fuzzy) game in which each of its sub-games has a non-empty core and, nevertheless, it is not a market game. It turns out that, in order to be a market game, a game needs also to be homogeneous. We also study investment games – which are fuzzy games obtained from an economy with a finite number of agents cooperating in one or more joint projects. It is argued that the usual definition of the core is inappropriate for such a model. We therefore introduce and analyze the new notion of comprehensive core. This solution concept seems to be more suitable for such a scenario. We finally refer to the notion of feasibility of an allocation in games with a large number of players. Some of the results in this paper appear in a previous draft distributed by the name “Cooperative investment games or Population games”. An anonymous referee of Economic Theory is acknowledged for his/her comments     

Strategic approximations of discontinuous games

An infinite game is approximated by restricting the players to finite subsets of their pure strategy spaces. A strategic approximationof an infinite game is a countable subset of pure strategies with the property that limits of all equilibria of all sequences of approximating games whose finite strategy sets eventually include each member of the countable set must be equilibria of the infinite game. We provide conditions under which infinite games admit strategic approximations.     

Existence of perfect equilibria: a direct proof

We provide a direct proof of the existence of perfect equilibria in finite normal form games and extensive games with perfect recall. It is done by constructing a correspondence whose fixed points are precisely the perfect equilibria of a given finite game. Existence of a fixed point is secured by a generalization of Kakutani theorem, which is proved in this paper. This work offers a new approach to perfect equilibria, which would hopefully facilitate further study on this topic. We also hope our direct proof would be the first step toward building an algorithm to find the set of all perfect equilibria of a strategic game.     

Dynamic group formation in the repeated prisoner?s dilemma

We consider dynamic group formation in repeated n-person prisoner?s dilemma. Agreements in coalitional bargaining are self-binding in that they are supported as subgame perfect equilibria of repeated games. Individuals are allowed to renegotiate the cooperating group agreement through a process of voluntary participation. We prove that a cooperating group forms as an absorbing state of a Markov perfect equilibrium after a finite number of renegotiations if and only if the group is Pareto efficient, provided that individuals are patient. The cooperating group can only expand.     

Competitive outcomes and the inner core of NTU market games

We consider the inner core as a solution concept for cooperative games with non-transferable utility (NTU) and its relationship to payoffs of competitive equilibria of markets that are induced by NTU games. An NTU game is an NTU market game if there exists a market such that the set of utility allocations a coalition can achieve in the market coincides with the set of utility allocations the coalition can achieve in the game. In this paper, we introduce a new construction of a market based on a closed subset of the inner core which satisfies a strict positive separability. We show that the constructed market represents the NTU game and, further, has the given closed set as the set of payoff vectors of competitive equilibria. It turns out that this market is not uniquely determined, and thus, we obtain a class of markets. Our results generalize those relating to competitive outcomes of NTU market games in the literature.     

The supercore for normal-form games

This paper analyzes the supercore of a system derived from a normal-form game. For the case of a finite game with pure strategies, we define a sequence of games and show that the supercore coincides with the set of Nash equilibria of the last game in that sequence. This result is illustrated with the characterization of the supercore for the n-person prisoner's dilemma. With regard to the mixed extension of a normal-form game, we show that the set of Nash equilibrium profiles coincides with the supercore for games with a finite number of Nash equilibria.     

A characterization of strategic complementarities

I characterize games for which there is an order on strategies such that the game has strategic complementarities. I prove that, with some qualifications, games with a unique equilibrium have complementarities if and only if Cournot best-response dynamics has no cycles; and that all games with multiple equilibria have complementarities. As applications of my results, I show that: (1) generic 2×2 games either have no pure-strategy equilibria, or have complementarities; (2) generic two-player finite ordinal potential games have complementarities.     

Subgame-perfect equilibria of finite- and infinite-horizon games

We show that subgame-perfect equilibria of infinite-horizon games arise as limits, as the horizon grows long and epsilon small, of subgame-perfect epsilon-equilibria of games which are truncated after a finite horizon. A number of applications show that this result provides a useful technique for analyzing the existence and uniqueness of infinite-horizon equilibria. We extend our result to the sequential equilibrium concept.