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.     

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.     

Rational expectations equilibrium and the strategic choice of costly information

This paper studies costly information acquisition in one-good production economies when agents acquire private information and prices transmit information. Before asset markets open, agents choose the quality of their private information. After this information stage, agents trade assets in sequentially complete markets taking into account their private information and the information revealed by equilibrium prices (rational expectations equilibrium, (Radner, R., 1979. Rational expectations equilibrium: generic existence and the information revealed by prices, Econometrica 47, 655–678.)). An overall equilibrium in asset and information market is defined as a Nash equilibrium of the information game in which agents’ actions are information choices and their utility payoffs are the ex-ante expected utilities of the corresponding rationale expectations equilibrium. This paper shows that for a generic set of economies parameterized by endowments and productivity shocks, an overall equilibrium in information and asset market (a Nash equilibrium of the induced information game) with costly information acquisition and fully-revealing prices exists. In other words, informational efficiency is in general consistent with costly information acquisition.     

Theoretical and Empirical Analysis of the Multiperiod Pricing Pattern in the Real Estate Market

We examine empirically and theoretically the multiperiod pricing pattern in the real estate market. First, in a game theoretic framework, we identify conditions for determining whether potential closing prices increase or decrease and marginally increase with time on market. Then, by observing rental housing transactions, we empirically find evidence that the difference between the list price and the settlement price rises and marginally decreases with time on market. This empirical result is consistent with a perfect Nash equilibrium previously proposed in the model.     

The local stability of an open-loop Nash equilibrium in a finite horizon differential game

We propose a finite time differential game as a model for some economic processes and derive conditions for the Nash equilibrium solution to be locally asymptotically stable. We adopt the traditional ‘Cournot-reaction function’ notion of stability, which in our (continuous time) model becomes a function-to-function, or trajectory-to-trajectory, mapping. The conditions for stability seem to make economic sense. The equilibrium is less stable if the interaction terms in each period are large, if the game has a long duration, and if the discount rate is small.     

Recursive Nash bargaining over a productive asset

We propose an equilibrium concept (the recursive Nash bargaining solution) that describes the outcome of repeated negotiations between two rational agents under the assumptions that the state of the economic system under consideration changes according to the actions of the players and that neither party can make binding commitments to future behavior. This equilibrium is dynamically consistent but typically not Pareto-efficient. As an application, we compute the recursive Nash bargaining solution in a model of two heterogeneous agents bargaining over the use of a productive asset with constant gross rate of return and study how the time-preference rates and the elasticities of substitution affect the solution.     

Is having a unique equilibrium robust?

We investigate whether having a unique equilibrium (or a given number of equilibria) is robust to perturbation of the payoffs, both for Nash equilibrium and correlated equilibrium. We show that the set of n  -player finite games with a unique correlated equilibrium is open, while this is not true of Nash equilibrium for n>2$n>2$. The crucial lemma is that a unique correlated equilibrium is a quasi-strict Nash equilibrium. Related results are studied. For instance, we show that generic two-person zero-sum games have a unique correlated equilibrium and that, while the set of symmetric bimatrix games with a unique symmetric Nash equilibrium is not open, the set of symmetric bimatrix games with a unique and quasi-strict symmetric Nash equilibrium is.     

Double implementation of the Lindahl equilibrium by a continuous mechanism

We consider a class of economies with public goods that have the following properties: (i) The preferences of the agents are convex, interior, and strictly increasing. (ii) The technology for production of public goods is a closed convex cone that satisfies free disposal and an additional mild assumption. No assumptions are made on continuity, completeness or transitivity of preferences. We provide a continuous and feasible mechanism that implements the Lindahl equilibrium by Nash equilibria, and has the following property: For every economy in our class every Nash equilibrium of the game induced by the mechanism is a strong Nash equilibrium.     

Existence and computation of Berge equilibrium and of two refinements

This paper presents existence conditions as well as computation methods for Berge equilibrium and two refinements: Berge–Vaisman equilibrium and Berge–Nash equilibrium. Each equilibrium concept is interpreted and illustrated on the basis of relevant examples and general existence conditions satisfying weak continuity and quasi-concavity conditions are provided.     

Stable matchings and the small core in Nash equilibrium in the college admissions problem

Both rematching proof and strong equilibrium outcomes are stable with respect to the true preferences in the marriage problem. We show that not all rematching proof or strong equilibrium outcomes are stable in the college admissions problem. But we show that both rematching proof and strong equilibrium outcomes in truncations at the match point are all stable in the college admissions problem. Further, all true stable matchings can be achieved in both rematching proof and strong equilibrium in truncations at the match point. We show that any Nash equilibrium in truncations admits one and only one matching, stable or not. Therefore, the core at a Nash equilibrium in truncations must be small. But examples exist such that the set of stable matchings with respect to a Nash equilibrium may contain more than one matching. Nevertheless, each Nash equilibrium can only admit at most one true stable matching. If, indeed, there is a true stable matching at a Nash equilibrium, then the only possible equilibrium outcome will be the true stable matching, no matter how different are players' equilibrium strategies from the true preferences and how many other unstable matchings are there at that Nash equilibrium. Thus, we show that a necessary and sufficient condition for the stable matching rule to be implemented in a subset of Nash equilibria by the direct revelation game induced by a stable mechanism is that every Nash equilibrium profile in that subset admits one and only one true stable matching. Received: 30 December 1998 / Accepted: 12 October 2001 This paper is a revision of the paper “Manipulation and Stability in a College Admissions Problem” circulated since 1994. I thank Rich McLean, Abraham Neyman, Mark Satterthwaite, Sang-Chul Suh, and Tetsuji Yamada for helpful discussions. I thank the associate editor and the two anonymous referees for their helpful comments that have greatly improved the paper. I am grateful to the Kellogg G.S.M. at the Northwestern University for the hospitality for my visit. Any errors are mine.     

Rent control with reputation: theory and evidence

Rent-control policy is modeled as an implicit contract between voters of a community and suppliers of rental housing. It is shown that if residents can make an ex ante commitment to never adopt rent controls they will do so. When precommitment is not possible there are conditions under which a policy of never adopting rent controls is not self-enforcing. Under such circumstances a state-invariant ceiling price is shown to be a subgame-perfect equilibrium rent-control policy. The model is tested using data for New Jersey where local option regarding the choice of rent control policy was declared constitutional in the early 1970s. Probit analysis is used to determine whether predictions of the model are supported by an investigation of factors leading to imposition of rent controls by 64 of the 245 communities in the sample.     

Imitation and price competition in a differentiated market

We study the stable market outcome that evolves in a spatially differentiated market when price-competing firms choose actions by imitation of the most profitable firm. We compare and contrast the stable outcomes under two imitation procedures: one, where each firm immediately imitates the most profitable firm, and the other when a firm imitates another firm only if it is more profitable while being “sufficiently similar” (in context of the market segment it operates in) or “sufficiently close”. In either case, the symmetric pure strategy Nash equilibrium is always a stable outcome. However, when imitation of the most profitable firm is immediate and market differentiation is ‘moderate’, states with prices lower than the Nash equilibrium are also stable. In contrast, when imitation of the most profitable firm is more gradual and market differentiation is below a threshold, states with prices above the Nash equilibrium are also stable. Thus, while competitive evolutionary pressure in this imitation based model does result in the Nash equilibrium always being stable, other outcomes may be stable as well. Interestingly, the states that are stable under gradual imitation give the firms a higher profit than the stable states under immediate imitation.     

Inefficiency of credible strategies in oligopolistic resource markets with uncertainty

The implications of different information patterns for firms in oligopolistic resource markets are considered. The traditional open-loop Nash equilibrium with static information sets is one of many possible Nash equilibria and is not suitable for stochastic environments. When shocks to resource growth are serially uncorrelated, there are no gains from conditioning the harvest on past stock levels and the feedback or credible Nash equilibrium is the appropriate Nash equilibrium concept. This credible equilibrium assumes that firms have knowledge of current stocks of reserves, which typically leads to more rapid extraction of the resource and possibly extinction. Since the open-loop Nash equilibrium is efficient when demand is iso-elastic and extraction costs are zero, it is clear that an increase in information can be detrimental to firms in the industry.     

Cournot tatonnement and potentials

We study what topological assumptions should be added to the acyclicity of individual best response improvements in order to ensure the existence of a (pure strategy) Nash equilibrium in a strategic game, as well as the possibility to reach a Nash equilibrium in the limit of a best response improvement path.     

Coordination, Differentiation, and the Timing of Radio Commercials

This paper examines the timing of commercial breaks by contemporary music radio stations. A simple model shows that stations may prefer, all else equal, to choose the same times (coordination) or different times (differentiation) for breaks depending on how listeners behave. It also shows that how much commercials overlap in Nash equilibrium should vary in different ways with observable market characteristics, such as the number of stations, depending on whether stations prefer to coordinate or differentiate. Panel data on the timing of commercials by 1,094 stations provide consistent support for the hypothesis that stations prefer to coordinate on timing .     

Local public goods in an equilibrium : How pecuniarv externalities matter

We study two Nash equilibria among a finite number of jurisdictions which maximize property values by providing public goods. In the first Nash equilibrium, the strategies are LPGs, financed by land taxes. We give conditions under which LPGs will be underprovided and show how this result is linked to price effects caused outside the jurisdiction. In the second Nash equilibrium, the strategies are LPGs and head taxes, with the budget balanced by land taxes. Jurisdiction-specific head taxes have incentive effects, whereas land taxes do not. In this case LPGs will be provided efficiently for the resident population.     

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.     

Full Nash implementation of neutral social functions

This paper characterizes neutral social functions that are fully implementable. A neutral social function must be monotonic and simple to be fully implementable under either the Nash equilibrium concept or the strong Nash equilibrium concept. If a neutral social function is monotonic and simple, then the social function is fully implementable by a set of Nash equilibria. For finite alternative sets a neutral social function will be fully implementable by a set of strong Nash equilibria if and only if it is monotonic, simple and dictatorial.     

Mechanism design for a solution to the tragedy of commons

We consider the problem of the tragedy of commons in cooperative production economies, and propose a mechanism to resolve this tragedy, taking into account that the coordinator cannot perfectly monitor each agent’s labor skill and each agent may have an incentive to overstate as well as understate his own skill. Even in such a situation, the mechanism implements the proportional solution (Roemer in Soc Philos Policy 6:74–92, 1989 and Roemer and Silvestre in J Econ Theory 59:426–444, 1993) in Nash and strong equilibria when it is played as a normal form game. Moreover, the mechanism triply implements the solution in Nash, subgame-perfect, and strong equilibria when it is played as a two-stage extensive form game. We are greatly thankful to Semi Koray, William Thomson, and an anonymous referee of this journal for their concrete and helpful comments on improving the paper. An earlier version of this paper was presented at the annual meeting of the Japanese Economic Association held at Hitotsubashi University in October 2001 and at the Conference on Economic Design held at NYU in July 2002. We are grateful to Takehiko Yamato for his useful comments in the former conference. We are also thankful to Tatsuyoshi Saijo, Kotaro Suzumura, and Yoshikatsu Tatamitani for their kind comments.     

Bayesian Nash equilibrium and variational inequalities

This paper provides a sufficient condition for the existence and uniqueness of a Bayesian Nash equilibrium by regarding it as a solution of a variational inequality. The payoff gradient of a game is defined as a vector whose component is a partial derivative of each player’s payoff function with respect to the player’s own action. If the Jacobian matrix of the payoff gradient is negative definite for each state, then a Bayesian Nash equilibrium is unique. This result unifies and generalizes the uniqueness of an equilibrium in a complete information game by Rosen (1965) and that in a team by Radner (1962). In a Bayesian game played on a network, the Jacobian matrix of the payoff gradient coincides with the weighted adjacency matrix of the underlying graph.