Corrigendum to “Discounted Stochastic Games With No Stationary Nash Equilibrium: Two Examples”

Levy (2013) presented examples of discounted stochastic games that do not have stationary equilibria. The second named author has pointed out that one of these examples is incorrect. In addition to describing the details of this error, this note presents a new example by the first named author that succeeds in demonstrating that discounted stochastic games with absolutely continuous transitions can fail to have stationary equilibria.     

Congestion games with mixed objectives

We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the (non-)existence of pure Nash equilibria (PNE), the convergence of improvement dynamics, the quality of equilibria and show the complexity of the decision problem. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria.     

Stationary Equilibria in Asset‐Pricing Models with Incomplete Markets and Collateral

We consider an infinite‐horizon exchange economy with incomplete markets and collateral constraints. As in the two‐period model of Geanakoplos and Zame (2002), households can default on their liabilities at any time, and financial securities are only traded if the promises associated with these securities are backed by collateral. We examine an economy with a single perishable consumption good, where the only collateral available consists of productive assets. In this model, competitive equilibria always exist and we show that, under the assumption that all exogenous variables follow a Markov chain, there also exist stationary equilibria. These equilibria can be characterized by a mapping from the exogenous shock and the current distribution of financial wealth to prices and portfolio choices. We develop an algorithm to approximate this mapping numerically and discuss ways to implement the algorithm in practice. A computational example demonstrates the performance of the algorithm and shows some quantitative features of equilibria in a model with collateral and default.     

Approximate versus Exact Equilibria in Dynamic Economies

This paper develops theoretical foundations for an error analysis of approximate equilibria in dynamic stochastic general equilibrium models with heterogeneous agents and incomplete financial markets. While there are several algorithms that compute prices and allocations for which agents' first‐order conditions are approximately satisfied (“approximate equilibria”), there are few results on how to interpret the errors in these candidate solutions and how to relate the computed allocations and prices to exact equilibrium allocations and prices. We give a simple example to illustrate that approximate equilibria might be very far from exact equilibria. We then interpret approximate equilibria as equilibria for close‐by economies; that is, for economies with close‐by individual endowments and preferences. We present an error analysis for two models that are commonly used in applications, an overlapping generations (OLG) model with stochastic production and an asset pricing model with infinitely lived agents. We provide sufficient conditions that ensure that approximate equilibria are close to exact equilibria of close‐by economies. Numerical examples illustrate the analysis.     

Weakly Belief‐Free Equilibria in Repeated Games With Private Monitoring

Repeated games with imperfect private monitoring have a wide range of applications, but a complete characterization of all equilibria in this class of games has yet to be obtained. The existing literature has identified a relatively tractable subset of equilibria. The present paper introduces the notion of weakly belief‐free equilibria for repeated games with imperfect private monitoring. This is a tractable class which subsumes, as a special case, a major part of the existing literature (the belief‐free equilibria). It is shown that this class can outperform the equilibria identified by the previous work.     

Truthful Equilibria in Dynamic Bayesian Games

This paper characterizes an equilibrium payoff subset for dynamic Bayesian games as discounting vanishes. Monitoring is imperfect, transitions may depend on actions, types may be correlated, and values may be interdependent. The focus is on equilibria in which players report truthfully. The characterization generalizes that for repeated games, reducing the analysis to static Bayesian games with transfers. With independent private values, the restriction to truthful equilibria is without loss, except for the punishment level: if players withhold their information during punishment‐like phases, a folk theorem obtains.     

Competition for a Majority

We define the class of two‐player zero‐sum games with payoffs having mild discontinuities, which in applications typically stem from how ties are resolved. For such games, we establish sufficient conditions for existence of a value of the game, maximin and minimax strategies for the players, and a Nash equilibrium. If all discontinuities favor one player, then a value exists and that player has a maximin strategy. A property called payoff approachability implies existence of an equilibrium, and that the resulting value is invariant: games with the same payoffs at points of continuity have the same value and ɛ‐equilibria. For voting games in which two candidates propose policies and a candidate wins election if a weighted majority of voters prefer his proposed policy, we provide tie‐breaking rules and assumptions about voters' preferences sufficient to imply payoff approachability. These assumptions are satisfied by generic preferences if the dimension of the space of policies exceeds the number of voters; or with no dimensional restriction, if the electorate is sufficiently large. Each Colonel Blotto game is a special case in which each candidate allocates a resource among several constituencies and a candidate gets votes from those allocated more than his opponent offers; in this case, for simple‐majority rule we prove existence of an equilibrium with zero probability of ties.     

On the performances of Nash equilibria in isolation games

We study the performances of Nash equilibria in isolation games, a class of competitive location games recently introduced in Zhao et al. (Proc. of the 19th International Symposium on Algorithms and Computation (ISAAC), pp. 148–159, 2008). For all the cases in which the existence of Nash equilibria has been shown, we give tight or asymptotically tight bounds on the prices of anarchy and stability under the two classical social functions mostly investigated in the scientific literature, namely, the minimum utility per player and the sum of the players’ utilities. Moreover, we prove that the convergence to Nash equilibria is not guaranteed in some of the not yet analyzed cases.     

Noisy Stochastic Games

This paper establishes existence of a stationary Markov perfect equilibrium in general stochastic games with noise—a component of the state that is nonatomically distributed and not directly affected by the previous period's state and actions. Noise may be simply a payoff‐irrelevant public randomization device, delivering known results on the existence of correlated equilibrium as a special case. More generally, noise can take the form of shocks that enter into players' stage payoffs and the transition probability on states. The existence result is applied to a model of industry dynamics and to a model of dynamic electoral competition.     

Existence and Uniqueness of Maximal Reductions Under Iterated Strict Dominance

Iterated elimination of strictly dominated strategies is an order dependent procedure. It can also generate spurious Nash equilibria, fail to converge in countable steps, or converge to empty strategy sets. If best replies are well–defined, then spurious Nash equilibria cannot appear; if strategy spaces are compact and payoff functions are uppersemicontinuous in own strategies, then order does not matter; if strategy sets are compact and payoff functions are continuous in all strategies, then a unique and nonempty maximal reduction exists. These positive results extend neither to the better–reply secure games for which Reny has established the existence of a Nash equilibrium, nor to games in which (under iterated eliminations) any dominated strategy has an undominated dominator.     

Existence of Equilibrium in Single and Double Private Value Auctions1

We show existence of equilibria in distributional strategies for a wide class of private value auctions, including the first general existence result for double auctions. The set of equilibria is invariant to the tie‐breaking rule. The model incorporates multiple unit demands, all standard pricing rules, reserve prices, entry costs, and stochastic demand and supply. Valuations can be correlated and asymmetrically distributed. For double auctions, we show further that at least one equilibrium involves a positive volume of trade. The existence proof establishes new connections among existence techniques for discontinuous Bayesian games.     

Large Robust Games

With many semi‐anonymous players, the equilibria of simultaneous‐move games are extensively robust. This means that the equilibria survive even if the simultaneous‐play assumption is relaxed to allow for a large variety of extensive modifications. Such modifications include sequential play with partial and differential revelation of information, commitments, multiple revisions of choices, cheap talk announcements, and more.     

Single Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information

This paper analyzes a class of games of incomplete information where each agent has private information about her own type, and the types are drawn from an atomless joint probability distribution. The main result establishes existence of pure strategy Nash equilibria (PSNE) under a condition we call the single crossing condition (SCC), roughly described as follows: whenever each opponent uses a nondecreasing strategy (in the sense that higher types choose higher actions), a player's best response strategy is also nondecreasing. When the SCC holds, a PSNE exists in every finite‐action game. Further, for games with continuous payoffs and a continuum of actions, there exists a sequence of PSNE to finite‐action games that converges to a PSNE of the continuum‐action game. These convergence and existence results also extend to some classes of games with discontinuous payoffs, such as first‐price auctions, where bidders may be heterogeneous and reserve prices are permitted. Finally, the paper characterizes the SCC based on properties of utility functions and probability distributions over types. Applications include first‐price, multi‐unit, and all‐pay auctions; pricing games with incomplete information about costs; and noisy signaling games.     

Corrigendum to “Games With Imperfectly Observable Actions in Continuous Time”

Sannikov (2007) investigated properties of perfect public equilibria in continuous‐time repeated games. This note points out that the proof of Lemma 6, required for the proof of the main theorem (Theorem 2), contains an error in computing a Hessian matrix. A correct proof of Lemma 6 is provided using an additional innocuous assumption and a generalized version of Lemma 5.     

On the Existence of Monotone Pure‐Strategy Equilibria in Bayesian Games

We generalize Athey's (2001) and McAdams' (2003) results on the existence of monotone pure‐strategy equilibria in Bayesian games. We allow action spaces to be compact locally complete metric semilattices and type spaces to be partially ordered probability spaces. Our proof is based on contractibility rather than convexity of best‐reply sets. Several examples illustrate the scope of the result, including new applications to multi‐unit auctions with risk‐averse bidders.     

Dynamic Global Games of Regime Change: Learning,Multiplicity, and the Timing of Attacks

Global games of regime change—coordination games of incomplete information in which a status quo is abandoned once a sufficiently large fraction of agents attack it—have been used to study crises phenomena such as currency attacks, bank runs, debt crises, and political change. We extend the static benchmark examined in the literature by allowing agents to take actions in many periods and to learn about the underlying fundamentals over time. We first provide a simple recursive algorithm for the characterization of monotone equilibria. We then show how the interaction of the knowledge that the regime survived past attacks with the arrival of information over time, or with changes in fundamentals, leads to interesting equilibrium properties. First, multiplicity may obtain under the same conditions on exogenous information that guarantee uniqueness in the static benchmark. Second, fundamentals may predict the eventual fate of the regime but not the timing or the number of attacks. Finally, equilibrium dynamics can alternate between phases of tranquility—where no attack is possible—and phases of distress—where a large attack can occur—even without changes in fundamentals.     

Efficiency in Games With Markovian Private Information

We study repeated Bayesian games with communication and observable actions in which the players' privately known payoffs evolve according to an irreducible Markov chain whose transitions are independent across players. Our main result implies that, generically, any Pareto‐efficient payoff vector above a stationary minmax value can be approximated arbitrarily closely in a perfect Bayesian equilibrium as the discount factor goes to 1. As an intermediate step, we construct an approximately efficient dynamic mechanism for long finite horizons without assuming transferable utility.     

Sequential Estimation of Dynamic Discrete Games: A Comment

Recursive procedures which are based on iterating on the best response mapping have difficulties converging to all equilibria in multi‐player games. We illustrate these difficulties by revisiting the asymptotic properties of the iterative nested pseudo maximum likelihood method for estimating dynamic games introduced by Aguirregabiria and Mira (2007). An example shows that the iterative method may not be consistent.     

Tenable Strategy Blocks and Settled Equilibria

When people interact in familiar settings, social conventions usually develop so that people tend to disregard alternatives outside the convention. For rational players to usually restrict attention to a block of conventional strategies, no player should prefer to deviate from the block when others are likely to act conventionally and rationally inside the block. We explore two set‐valued concepts, coarsely and finely tenable blocks, that formalize this notion for finite normal‐form games. We then identify settled equilibria, which are Nash equilibria with support in minimal tenable blocks. For a generic class of normal‐form games, our coarse and fine concepts are equivalent, and yet they differ from standard solution concepts on open sets of games. We demonstrate the nature and power of the solutions by way of examples. Settled equilibria are closely related to persistent equilibria but are strictly more selective on an open set of games. With fine tenability, we obtain invariance under the insertion of a subgame with a unique totally mixed payoff‐equivalent equilibrium, a property that other related concepts have not satisfied.     

Backward Induction Foundations of the Shapley Value

We present a noncooperative game model of coalitional bargaining, closely based on that of Gul (1989) but solvable by backward induction. In this game, Gul's condition of “value additivity” does not suffice to ensure the existence of a subgame perfect Nash equilibrium that supports the Shapley value, but a related condition—“no positive value‐externalities”—does. Multiple equilibria can arise only in the event of ties, and with a mild restriction on tie‐break rules these equilibria all support the Shapley value.