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.     

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.     

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.     

Learning about learning in games through experimental control of strategic interdependence

We report results from an experiment in which humans repeatedly play one of two games against a computer program that follows either a reinforcement or an experience weighted attraction learning algorithm. Our experiment shows these learning algorithms detect exploitable opportunities more sensitively than humans. Also, learning algorithms respond to detected payoff-increasing opportunities systematically; however, the responses are too weak to improve the algorithms' payoffs. Human play against various decision maker types does not vary significantly. These factors lead to a strong linear relationship between the humans' and algorithms' action choice proportions that is suggestive of the algorithms' best response correspondences.     

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.     

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.     

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 implementation and complexity considerations

A game form is commitment-free if single actions of players do not have physical consequences, i.e., affect the continuation game. Such game can be thought to represent inifinite interaction with complete patience. A choice rule can be Nash implemented via a commitment-free mechanism if and only if it coincides with the feasible set of a normal form game. However, when players are complexity averse (in the lexicographic sense), then any Nash implementable choice rule becomes available. I am very grateful to Matt Jackson and a referee for their comments. I also thank Klaus Kultti and Hannu Salonen for useful conversations.     

Elections and strategic positioning games

We formalize the interplay between expected voting behavior and strategic positioning behavior of candidates as a common agency problem in which the candidates (i.e., the principals) compete for voters (i.e., agents) via the issues they choose and the positions they take. A political situation is defined as a feasible combination of candidate positions and expected political payoffs to the candidates. Taking this approach, we are led naturally to a particular formalization of the candidates' positioning game, called a political situation game. Within the context of this game, we define the notion of farsighted stability (introduced in an abstract setting by Chwe 1994) and apply Chwe's result to obtain existence of farsightedly stable outcomes. We compute the farsightedly stable sets for several examples of political situations games, with outcomes that conform to real-world observations.Received: 18 May 2001, Accepted: 22 January 2002, JEL Classification: C7, D7, D8Myrna H. Wooders: http://www.warwick.ac.uk/fac/soc/Economics/wooders/An earlier version of this paper was completed while the first author was visiting the Department of Economics, University of Exeter. The first author gratefully acknowledges Exeter's support and hospitality. Similarly, the second author gratefully acknowledges the support and hospitality of the Centre for Operations Research and Econometrics (CORE) of the University of Louvain-la-Neuve, Belgium and of the University of Cergy-Pontoise, France. Both authors are indebted to Amrita Dhillon, John Duggan and Gilat Levy for helpful comments about references. Both authors thank an anonymous referee for helpful comments.     

Repeated moral hazard and recursive Lagrangeans

This paper shows how to solve dynamic agency models by extending recursive Lagrangean techniques à la Marcet and Marimon (2011) to problems with hidden actions. The method has many advantages with respect to the promised utilities approach (Abreu et al., 1990): it is a significant improvement in terms of simplicity, tractability and computational speed. Solutions can be easily computed for hidden actions models with several endogenous state variables and several agents, while the promised utilities approach becomes extremely difficult and computationally intensive even with just one state variable or two agents.     

Pure strategy equilibria in games with private and public information

We introduce a new game form which allows the players’ strategies to depend on their strategy-relevant private information as well as on some publicly announced information. The players’ payoffs depend on their own payoff-relevant private information and some payoff-relevant common information. Under the assumption that the players’ strategy-relevant private information is diffuse and their private information is conditionally independent given the public and payoff-relevant common information, we prove the existence of a pure strategy equilibrium for such a game by developing a distribution theory of correspondences via vector measures.     

Best response dynamics with level-n expectations in two-stage games

This paper analyzes behavior in repeatedly played two-stage games, where players choose actions in both stages according to best replies using level-n expectations about the opponent׳s actions in both stages. Level-n expectations are recursively defined in a way that a player holding level-n expectations correctly predicts the action of an opponent holding level-(n−1) expectations. A general conceptual framework to study such dynamics for two-stage games is developed and it is shown that, contrary to results for single-stage games, the fixed points of the dynamics depend on the level of the expectations. In particular, for level-0 expectation, fixed points correspond to a Nash equilibrium of a simultaneous move version of the game, whereas (under certain conditions) fixed points converge towards the subgame perfect equilibrium of the two-stage game if the level of expectations goes to infinity. The approach is illustrated using a two-stage duopoly game, where firms in the first stage invest in activities reducing their marginal costs and in the second stage engage in Cournot competition. Conditions for local stability of the fixed points are derived for different levels of expectations and it is shown that level-2 expectations are sufficient to move the fixed-point of the dynamics to a close neighborhood of the subgame perfect equilibrium. Furthermore, it is demonstrated that although firms benefit from unilateral increases in the level of expectations, an increase of n by all firms reduces all profits.     

Coalitional games with veto players: Consistency, monotonicity and Nash outcomes

Following Dagan et al. [Dagan, N., Volij, O., Serrano, R. (1997). A non-cooperative view on consistent bankruptcy rules, Games Econ. Behav. 18, 55–72], we construct an extensive form game for veto-balanced TU games in which a veto player is the proposer and the other players are responders. The set of Nash outcomes of this extensive form game is described, and compared to solutions of TU games such as the nucleolus, kernel and egalitarian core. We find necessary and sufficient conditions under which the nucleolus of the game is a Nash outcome.     

Solving dynamic public insurance games with endogenous agent distributions: Theory and computational approximation

We make two contributions in this paper. First, we extend the characterization of equilibrium payoff correspondences in history-dependent dynamic policy games to a class with endogenously heterogeneous private agents. In contrast to policy games involving representative agents, this extension has interesting consequences as it implies additional nonlinearity (i.e., bilinearity) between the game states (distributions) and continuation/promised values in the policymaker’s objective and incentive constraints. The second contribution of our paper is in addressing the computational challenges arising from this payoff-relevant nonlinearity. Exploiting the game’s structure, we propose implementable approximate bilinear programming formulations to construct estimates of the equilibrium value correspondence. Our approximation method respects the property of upper hemicontinuity in the target correspondence. We provide small-scale computational examples as proofs of concept.     

Strategic complementarities and nested potential games

This paper reports that every finite game of strategic complementarities is a nested pseudo-potential game defined by Uno [Uno, H., 2007. Nested potential games. Economics Bulletin 3(17), 1–8] if the action set of each player is one-dimensional, except possibly for one player.     

Endogenous mechanisms and Nash equilibrium in competitive contracting games

We model strategic competition in a market with asymmetric information as a noncooperative game in which each firm competes for the business of a buyer of unknown type by offering the buyer a catalog of products and prices. The timing in our model is Stackelberg: in the first stage, given the distribution of buyer types known to all firms and the deducible, type-dependent best responses of the agent, firms simultaneously and noncooperatively choose their catalog offers. In the second stage the buyer, knowing his type, chooses a single firm and product-price pair from that firm’s catalog. By backward induction, this Stackelberg game with asymmetric information reduces to a game over catalogs with payoff indeterminacies. In particular, due to ties within catalogs and/or across catalogs, corresponding to any catalog profile offered by firms there may be multiple possible expected firm payoffs, all consistent with the rational optimizing behavior of the agent for each of his types. The resolution of these indeterminacies depends on the tie-breaking mechanism which emerges in the market. Because each tie-breaking mechanism induces a particular game over catalogs, a reasonable candidate would be a tie-breaking mechanism which supports a Nash equilibrium in the corresponding catalog game. We call such a mechanism an endogenous Nash mechanism. The fundamental question we address in this paper is, does there exist an endogenous Nash mechanism—and therefore, does there exist a Nash equilibrium for the catalog game? We show under fairly mild conditions on primitives that catalog games naturally possess tie-breaking mechanisms which support Nash equilibria.     

Regularity and robustness in monotone Bayesian games

This paper defines regular and weakly regular equilibria for monotone Bayesian games with one-dimensional actions and types. It analyzes the robustness of equilibria with respect to perturbations. It also proves an index theorem and provides applications to uniqueness of equilibrium.     

奥运经济与北京城市发展

本文对奥运经济对北京城市发展的影响做了初步分析,并提出了相应的政策建议,以便更好地利用承办2008年奥运会的机遇促进北京经济的进一步发展.