Potential games with incomplete preferences

This paper studies potential games allowing the possibility that players have incomplete preferences and empty best-response sets. We define four notions of potential games, ordinal, generalized ordinal, best-response, and generalized best-response potential games, and characterize them using cycle conditions. We study Nash equilibria of potential games and show that the set of Nash equilibria remains the same when every player’s preferences are replaced with the smallest generalized (best-response) potential relation or a completion of it. Similar results are established about strict Nash equilibria of ordinal and best-response potential games. Lastly, we examine the relations among the four notions of potential games as well as pseudo-potential games.     

Debt stabilization games in the presence of risk premia

As a result of the recent financial crisis and the ensuing economic recession, fiscal deficits have soared in many OECD countries. As a consequence, government debt has been on the rise again after a period of stable or declining government debt. In this paper we analyze debt stabilization in a country that features endogenous risk premia, imposed by financial markets that evaluate the probability of debt default by governments. Endogenous risk premia arise by assuming, e.g., simple linear relations between risk premia and the level of debt. As a result the real interest rate on government debt can be written as a constant (measuring the risk-free real interest rate corrected for real output growth) plus an endogenous risk premium that depends on the debt level. We bring such an endogenous risk premium into Tabellini (1986) model and analyze the impact of it. This gives rise to a non-linear differential game. We solve this game for both a cooperative setting and a non-cooperative setting. The non-cooperative game is solved under an open-loop information structure. We present a bifurcation analysis w.r.t. the risk premium parameter.     

Repeated two-person zero-sum games with unequal discounting and private monitoring

We consider discounted repeated two-person zero-sum games with private monitoring. We show that even when players have different and time-varying discount factors, each player’s payoff is equal to his stage-game minmax payoff in every sequential equilibrium. Furthermore, we show that: (a) in every history on the equilibrium path, the pair formed by each player’s conjecture about his opponent’s action must be a Nash equilibrium of the stage game, and (b) the distribution of action profiles in every period is a correlated equilibrium of the stage game. In the particular case of public strategies in public monitoring games, players must play a Nash equilibrium after any public history.     

Rationalizability in continuous games

Define a continuous game to be one in which every player's strategy set is a Polish space, and the payoff function of each player is bounded and continuous. We prove that in this class of games the process of sequentially eliminating “never-best-reply” strategies terminates before or at the first uncountable ordinal, and this bound is tight. Also, we examine the connection between this process and common belief of rationality in the universal type space of Mertens and Zamir (1985).     

Large but finite games with asymmetric information

Carmona considered an increasing sequence of finite games in each of which players are characterized by payoff functions that are restricted to vary within a uniformly equicontinuous set and choose their strategies from a common compact metric strategy set. Then Carmona proved that each finite game in an upper tail of such a sequence admits an approximate Nash equilibrium in pure strategies.     

Network games with incomplete information

We consider a network game with strategic complementarities where the individual reward or the strength of interactions is only partially known by the agents. Players receive different correlated signals and they make inferences about other players’ information. We demonstrate that there exists a unique Bayesian-Nash equilibrium. We characterize the equilibrium by disentangling the information effects from the network effects and show that the equilibrium effort of each agent is a weighted combinations of different Katz–Bonacich centralities.     

Repeated games in continuous time as extensive form games

Extensive form games modeling continuous-time decisions are plagued with problems of nonexistence and nonuniqueness of outcomes. As a “second-best”, the literature has imposed extraneous restrictions on the strategy sets, raising questions on the nature and interpretation of the resulting formal object, and on which restrictions are appropriate. We provide a “first-best” framework, formalizing continuous-time repeated games as extensive form games incorporating natural conditions from the onset. Every strategy profile induces a unique outcome, without any restrictions on the strategy sets. Further, the unrestricted strategy sets are equivalent to a specific class of strategies in a more naïvely specified continuous-time game.     

Two-step two-stage least squares estimation in models with rational expectations

The paper develops a two-step estimator for use in rational-expectations models with autocorrelated residuals and predetermined, but not strictly exogenous, instruments. The estimator extends the applicability of McCallum's (1976) error-in-variablesapproach to estimating such models, and is asymptotically efficient in a class of intrumental-variables estimators. As an application we use instrumental-variables techniques to estimate Taylor's (1979) rational-expectations macroeconomic model of the United States.     

A note on the evaluation of information in zero-sum repeated games

Two players play a zero-sum repeated game with incomplete information. Before the game starts one player receives a private signal that depends on the realized state of nature. The rules that govern the choice of the signal are determined by the information structure of the game. Different information structures induce different values. The value-of-information function of a game associates every information structure with the value it induces. We characterize those functions that are value-of-information functions for some zero-sum repeated game with incomplete information.     

Micro-interaction dynamics in group decision making: Face games, interaction order and boundary work

Drawing on Goffman's face theory, this paper documents and interprets the micro interaction dynamics underlying group decision making within a consultancy task force. Our analysis suggests that decision making is an instance of strategic face-to-face behavior where individuals seek to influence each other and reach decisions by means of face-work and self-presentation tactics. Moreover, face-to-face behavior generates an ‘interaction order’ that frames the decision making situation and constrains further interactions among decision makers. We discuss the implications that can be drawn from the observed case by relating our findings to the emergent stream of studies on micro-decision making.     

Subgame-perfect equilibria in stochastic timing games

We develop a notion of subgames and the related notion of subgame-perfect equilibrium – possibly in mixed strategies – for stochastic timing games. To capture all situations that can arise in continuous-time models, it is necessary to consider stopping times as the starting dates of subgames. We generalize Fudenberg and Tirole’s (Rev. Econom. Stud. 52, 383–401, 1985) mixed-strategy extensions to make them applicable to stochastic timing games and thereby provide a sound basis for subgame-perfect equilibria of preemption games. Sufficient conditions for equilibrium existence are presented, and examples illustrate their application as well as the fact that intuitive arguments can break down in the presence of stochastic processes with jumps.     

Negotiation games with unobservable mixed disagreement actions

A negotiation model combines an alternating offers bargaining game with a normal form stage game that determines players’ (interim) disagreement payoffs. Busch and Wen [Econometrica 63 (1995) 545] investigated this negotiation model under the assumption that players’ past mixed disagreement actions are observable. The question arises if this assumption is a substantial restriction. In this paper, we adopt the more plausible assumption that only the realizations of past mixed actions are observable, and find that the set of equilibrium payoffs shrinks, compared to that when mixed disagreement actions are observable. We precisely identify the effects of the unobservability and characterize the limiting set of equilibrium payoffs as the two players become sufficiently patient.     

Escape dynamics and equilibria selection by iterative cycle decomposition

This paper explores the medium-run behaviour of bounded rational players in repeatedly played games when they occasionally experiment or make mistakes. The formal analysis introduces a hierarchical structure of limit sets to characterize the most possible medium-run behaviour over gradually increased time intervals. The paper refines the notion of stochastic stability and offers a precise measure of the speed at which stochastically stable equilibria occur. Finally, the paper applies the results to a 3×3 symmetric game of Young (1993).     

Markov Perfect equilibria in repeated asynchronous choice games

This paper examines the issue of multiplicity of Markov Perfect equilibria in alternating move repeated games. Such games are canonical models of environments with repeated, asynchronous choices due to inertia or replacement. Our main result is that the number of Markov Perfect equilibria is generically finite with respect to stage game payoffs. This holds despite the fact that the stochastic game representation of the alternating move repeated game is “non-generic” in the larger space of state dependent payoffs. We further obtain that the set of completely mixed Markov Perfect equilibria is generically empty with respect to stage game payoffs.     

Endogenous institutions in bureaucratic compliance games

We consider a set-up where two governments have either conflicting or matching preferences on the provision of differentiated (local) goods supplied by a common monopoly bureau. We develop a two-stage game. At stage-1, the two governments decide whether or not to merge into a single institution. At stage-2, all players simultaneously and independently take their decisions in terms of production and rents, with perfect knowledge of the other players' strategies. We solve the subgame perfect Nash equilibrium of this game, and show that, if the bureau immediately updates its objective function to institutional changes, then the governments always prefer merging. However, if there is an initial bureaucratic inertia in adjusting the bureau's objective function to the institutional change, then ruling politicians may prefer decentralisation to centralisation, depending on the strategic properties of the compliance game and on their own discounting. Received: May 1999 / Accepted April 2000     

Recurrent crises in global games

Global games have unique equilibria in which aggregate behavior changes sharply when an underlying random fundamental crosses some threshold. This property relies on the existence of dominance regions: all players have a highest and lowest action that, for some fundamentals, is strictly dominant. But if the fundamental follows a random walk, it eventually spends nearly all of its time in these regions: crises gradually disappear. We obtain recurring crises by adding a single large player who lacks dominance regions. We also show that in order to obtain recurring crises, one must either relax dominance regions or restrict to fundamentals that continually return to or cross over a fixed region.     

Evolving densities in continuous strategy games through particle simulations

Many cases of strategic interaction between agents involve a continuous set of choices. It is natural to model these problems as continuous space games. Consequently, the population of agents playing the game will be represented with a density function defined over the continuous set of strategy choices. Simulating evolutionary dynamics on continuous strategy spaces is a challenging problem. The classic approach of discretizing the strategy space is ineffective for multidimensional strategy spaces. We present a principled approach to simulation of adaptive dynamics in continuous space games using sequential Monte Carlo methods. Sequential Monte Carlo methods use a set of weighted random samples, also named particles to represent density functions over multidimensional spaces. Sequential Monte Carlo methods provide computationally efficient ways of computing the evolution of probability density functions. We employ resampling and smoothing steps to prevent particle degeneration problem associated with particle estimates. The resulting algorithm can be interpreted as an agent based simulation with elements of natural selection, regression to mean and mutation. We illustrate the performance of the proposed simulation technique using two examples: continuous version of the repeated prisoner dilemma game and evolution of bidding functions in first-price closed-bid auctions.     

Convergence in games with continua of equilibria

In game theory, the question of convergence of dynamical systems to the set of Nash equilibria has often been tackled. When the game admits a continuum of Nash equilibria, however, a natural and challenging question is whether convergence to the set of Nash equilibria implies convergence to a Nash equilibrium. In this paper we introduce a technique developed in Bhat and Bernstein (2003) as a useful way to answer this question. We illustrate it with the best-response dynamics in the local public good game played on a network, where continua of Nash equilibria often appear.