Existence of equilibria in countable games: An algebraic approach

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Waldʼs pick-the-larger-integer game. Several authors have provided conditions for the existence of equilibria in infinite games. These conditions are typically of topological nature and are rarely applicable to countable games. Here we establish an existence result for the equilibrium of countable games when the strategy sets are a countable group, the payoffs are functions of the group operation, and mixed strategies are not requested to be σ-additive. As a byproduct we show that if finitely additive mixed strategies are allowed, then Waldʼs game admits an equilibrium. Finally we extend the main results to uncountable games.     

Stochastic Cooperative Games: Superadditivity, Convexity, and Certainty Equivalents

This paper extends the notions of superadditivity and convexity to stochastic cooperative games. It is shown that convex games are superadditive and have nonempty cores, and that these results also hold in the context of NTU games. Furthermore, a subclass of stochastic cooperative games to which one can associate a deterministic cooperative game is considered. It is shown that such a stochastic cooperative game satisfies properties like nonemptiness of the core, superadditivity, and convexity if and only if the corresponding deterministic game satisfies these properties.Journal of Economic LiteratureClassification Number: C71.     

p-Dominance and Equilibrium Selection under Perfect Foresight Dynamics

This paper studies equilibrium selection based on a class of perfect foresight dynamics and relates it to the notion of p-dominance. A continuum of rational players is repeatedly and randomly matched to play a symmetric n×n game. There are frictions: opportunities to revise actions follow independent Poisson processes. The dynamics has stationary states, each of which corresponds to a Nash equilibrium of the static game. A strict Nash equilibrium is linearly stable under the perfect foresight dynamics if, independent of the current action distribution, there exists a consistent belief that any player necessarily plays the Nash equilibrium action at every revision opportunity. It is shown that a strict Nash equilibrium is linearly stable under the perfect foresight dynamics with a small degree of friction if and only if it is the p-dominant equilibrium with p<1/2. It is also shown that if a strict Nash equilibrium is the p-dominant equilibrium with p<1/2, then it is uniquely absorbing (and globally accessible) for a small friction (but not vice versa). Set-valued stability concepts are introduced and their existence is shown. Journal of Economic Literature Classification Numbers: C72, C73.     

Recursive preferences and balanced growth

We study a class of utility functions that are defined recursively by an aggregator W(x,y) where u_t=W(c_t,u_t+1). In single-agent economies it is known that a sufficient condition for the existence of a balanced growth path is that utility should be homogenous of degree γ. In the context of a multi-agent economy we show that this restriction implies that either a balanced growth equilibrium fails to exist or all agents have the same constant discount factor. We suggest a generalization of recursive preferences wherein the intertemporal utility function is time dependent. Within this class we establish that there may exist a balanced growth equilibrium even if agents are different.     

Proper belief revision and equilibrium in dynamic games

We present a theory of rationality in dynamic games in which players, during the course of the game, may revise their beliefs about the opponents’ utility functions. The theory is based upon the following three principles: (1) the players’ initial beliefs about the opponents’ utilities should agree on some profile u of utility functions, (2) every player should believe, at each of his information sets, that his opponents are carrying out optimal strategies and (3) a player at information set h should not change his belief about an opponent's ranking of strategies a and b if both a and b could have led to h. Scenarios with these properties are called preference conjecture equilibria for the profile u of utility functions. We show that every normal form proper equilibrium for u induces a preference conjecture equilibrium for u, thus implying existence of preference conjecture equilibrium.     

Existence and fairness of value allocation without convex preferences

Shafer (Econometrica, 48 (1980), 467–476) proved that in a finite exchange economy value allocations exist, provided that each agent has convex, complete, transitive, compact and monotone preferences. However, if preferences are not convex, then value allocations may not exist. To remedy this difficulty we enlarge the set of value allocations by introducing the concept of approximate value allocations, and show that in a finite exchange economy approximate value allocations exist, even if preferences are not convex, or compact, or monotone. This value existence result can be used to provide a very general value existence theorem for a sequence of finite economies. Further, we show that value allocations may discriminate in favor of or against a coalition of agents.     

On equilibrium in Hart's securities exchange model

In this paper, we use a no unbounded arbitrage condition to give a very direct proof of the existence of equilibrium in Hart's unbounded securities exchange model (J. Econ. Theory, 9 (1974), 293–311). We also examine the relationship between the no unbounded arbitrage condition and the sufficiency conditions of Hart, ibid. and Hammond (J, Econ. Theory, 31 (1983), 170–175). We present an example to show that if traders are not sufficiently risk averse, then Hammond's overlapping expectations condition is not, in general, equivalent to the no unbounded arbitrage condition or Hart's sufficiency conditions, and therefore, is not sufficient to guarantee the existence of equilibrium. We also present an example to show that it is possible for the no unbounded arbitrage condition to hold without overlapping expectations, and therefore, it is possible for equilibrium to exist without overlapping expectations.     

Robust equilibria under non-common priors

This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogeneous priors. An equilibrium of a complete information game is robust to incomplete information under non-common priors if for every incomplete information game where each player's prior assigns high probability on the event that the players know at arbitrarily high order that the payoffs are given by the complete information game, there exists a Bayesian Nash equilibrium that generates behavior close to the equilibrium in consideration. It is shown that for generic games, an equilibrium is robust under non-common priors if and only if it is the unique rationalizable action profile. Set-valued concepts are also introduced, and for generic games, a smallest robust set is shown to exist and coincide with the set of a posteriori equilibria.     

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.     

Agreeable bets with multiple priors

This paper considers a two-agent model of trade with multiple priors. Firstly, we characterize the existence of an agreeable bet on some event in terms of the set of priors. It is then shown that the existence of an agreeable bet on some event is a strictly stronger condition than the existence of an agreeable trade, whereas the two conditions are equivalent in the standard Bayesian framework. Secondly, we show that the two conditions are equivalent when the set of priors is the core of a convex capacity. These results are also related to the no trade theorems under asymmetric information.     

An admissible set occurring in various bargaining situations

Given a set of alternatives S and a binary relation M on S the admissible set of the pair (S, M) is defined to be the set of maximal elements with respect to the transitive closure of M. It is shown that existing solutions in game theory and mathematical economics are special cases of this concept (they are admissible sets of a natural S and M). These include the core of an n-person cooperative game, Nash equilibria of a noncooperative game, and the max-min solution of a two-person zero sum game. The competitive equilibrium prices of a finite exchange economy are always contained in its admissible set. Special general properties of the admissible set are discussed. These include existence, stability, and a stochastic dynamic process which leads to outcomes in the admissible set with high probability.     

Variational convergence: Approximation and existence of equilibria in discontinuous games

We introduce a notion of variational convergence for sequences of games and we show that the Nash equilibrium map is upper semi-continuous with respect to variationally converging sequences. We then show that for a game G with discontinuous payoff, some of the most important existence results of Dasgupta and Maskin, Simon, and Reny are based on constructing approximating sequences of games that variationally converge to G. In fact, this notion of convergence will help simplify these results and make their proofs more transparent. Finally, we use our notion of convergence to establish the existence of a Nash equilibrium for Bertrand-Edgeworth games with very general forms of tie-breaking and residual demand rules.     

Repeated games with present-biased preferences

We study infinitely repeated games with perfect monitoring, where players have β-δ preferences. We compute the continuation payoff set using recursive techniques and then characterize equilibrium payoffs. We then explore the cost of the present-time bias, producing comparative statics. Unless the minimax outcome is a Nash equilibrium of the stage game, the equilibrium payoff set is not monotonic in β or δ. Finally, we show how the equilibrium payoff set is contained in that of a repeated game with smaller discount factor.     

Subgame Perfect Equilibria in Stage Games

It is well known that a stage game with infinite choice-sets, unless it contains a public coordination-device in each stage, may have no subgame perfect equilibria. We show that if a game with public coordination-devices has a subgame perfect equilibrium in which two players in each stage use non-atomic strategies, then the game without coordination devices also has a subgame perfect equilibrium. Journal of Economic Literature Classification Numbers: C6, C7, D8.     

Instability in the implementation of Walrasian allocations

The existence of game forms which implement Walrasian allocations as Cournot (Nash) equilibrium outcomes is well known. However, if the equilibria are also required to be locally dynamically stable, at least for environments with unique Walrasian allocations, this paper shows that the requisite game forms do not exist. Our definition of a game form entails certain regularity conditions, and requires the Cournot equilibrium to be unique when the Walrasian equilibrium is unique. The main result is that for such a game form, there does not exist a continuous-time strategy adjustment process which ensures the local stability of Cournot equilibria throughout a certain class of environments having unique Walrasian equilibria. Each trader adjusts his strategy in response to his own characteristics and the observed current strategies of others; but the direction and magnitude of adjustments are not constrained by any behavioral assumptions. The definitions permit the inclusion of an artificial player, such as an auctioneer, so the well-known tatonnement instability emerges as a special case.     

Legislative Bargaining and Coalition Formation

The finite horizon version of D. P. Baron and J. Ferejohn's [1989, Amer. Polit. Sci. Rev.83, 1181-1206] legislative bargaining model is investigated. With three or more periods, a continuum of divisions is supportable as subgame perfect equilib- ria. There exist equilibria where coalitions larger than a minimal winning coalition receive strictly positive shares. With sufficiently patient players and a sufficiently long horizon, any interior distribution is supportable as an equilibrium. In contrast, a generic uniqueness result applies when introducing heterogenous time preferences. The unique backwards induction equilibrium in the perturbed game is nonstationary, and neither the original (symmetric) nor the perturbed game provides guidance for equilibrium selection in the infinite game. Journal of Economic Literature Classification Numbers: C73, C78, D72, D78, H49.     

Money in the pure consumption loan model

The purpose of this paper is to show how modern techniques of Temporary competitive equilibrium analysis can be applied to models of the “pure consumption loan model” type. One considers Samuelson's simplest model where traders live two periods and where money is the only store of value. It is proved that a temporary equilibrium exists if price expectations are sufficiently independent of current prices. A stationary market equilibrium is shown to exist if there is a set of traders (i) whose total resources are greater when they are young than when they are old, (ii) who are indifferent between present and future consumption. It is proved that this existence theorem still holds if the economy is sufficiently “close” to an economy which has this property. A stationary market equilibrium is shown to be Pareto optimal if all traders hold positive cash balances. It may be inefficient if this condition is not satisfied, for some traders may then be willing to borrow, which they cannot do in this model.     

Local coordination and market equilibria

We reformulate the local stability analysis of market equilibria in a competitive market as a local coordination problem in a market game, where the map associating market prices to best-responses of all traders is common knowledge and well-defined both in and out of equilibrium. Initial expectations over market variables differ from their equilibrium values and are not common knowledge. This results in a coordination problem as traders use the structure of the market game to converge back to equilibrium. We analyse a simultaneous move and a sequential move version of the market game and explore the link with local rationalizability.     

A SPATIAL MODEL OF CARTEL STABILITY: THE INFLUENCE OF PRODUCTION COST CONVEXITY

We uniquely introduce convex production costs into a cartel model involving spatial price discrimination. We demonstrate that greater convexity improves cartel stability and that for sufficient convexity first best locations will be adopted. We show that allowing locations to vary over the game reduces cartel stability but that greater convexity continues to improve that stability. Moreover, when the degree of convexity does not support the first best collusive locations, other collusive locations exist that require less stability and these may either increase or decrease social welfare relative to competition. Critically, these locations that require less stability are more dispersed in sharp contrast to the known result assuming linear production costs.     

Efficiency properties of strategies market games: An axiomatic approach

The paper investigates the conditions under which an abstractly given market game will have the property that if there is a continuum of traders then every noncooperative equilibrium is Walrasian. In orther words, we look for a general axiomatization of Cournot's well-known result. Besides some convexity, continuity, and nondegeneracy hypotheses, the crucial axioms are: anonymity (i.e., the names of traders are irrelevant to the market) and aggregation (i.e., the net trade received by a trader depends only on his own action and the mean action of all traders). It is also shown that the same axioms do not guarantee efficiency if there is only a finite number of traders. Some examples are discussed and a notion of strict noncooperative equilibrium for anonymous games is introduced.