A mechanism implementing the proportional solution

We consider the problem of a commonly owned technology which transforms a single input into a single output. We are interested in implementing a social choice rule called theproportional solution. We introduce a mechanism which implements the proportional solution in Nash, strong (Nash) and undominated Nash equilibria. In the mechanism each agent announces only two numbers which can be interpreted as the total output and her share of the total input-output combination. This paper was originally titled "Doubly implementing the proportional solution." I would like to thank my advisor William Thomson for his detailed comments and suggestions. I would also like to thank Jeffrey Banks and Sung-Whee Shin for their comments. Two anonymous referees and an editor’s comments improved this paper substantially.     

Nash implementation with an infinite-dimensional trade space

This paper deals with the problem of implementing the Walras correspondence via Nash equilibria, in exchange economies with infinitely many commodities and finitely many households with possibly non-ordered preferences. We explicitly construct a feasible mechanism enjoying some features, which have natural economic meanings. Under a fairly weak boundary condition, this game fully implements the Walras equilibria. If this condition is not fulfilled, our mechanism nevertheless implements the constrained Walras equilibria. Received: 11 December 2003, Accepted: 29 July 2005 JEL Classification: D41, D43, D51 We thank (without implicating) Prof. Jean-Marc Bonnisseau and Cuong Le Van for helpful comments. The views expressed in this paper reflect those of the authors and not necessarily those of Calyon.     

Spatial social networks

We introduce a spatial cost topology in the network formation model analyzed by Jackson and Wolinsky, Journal of Economic Theory (1996), 71: 44–74. This cost topology might represent geographical, social, or individual differences. It describes variable costs of establishing social network connections. Participants form links based on a cost-benefit analysis. We examine the pairwise stable networks within this spatial environment. Incentives vary enough to show a rich pattern of emerging behavior. We also investigate the subgame perfect implementation of pairwise stable and efficient networks. We construct a multistage extensive form game that describes the formation of links in our spatial environment. Finally, we identify the conditions under which the subgame perfect Nash equilibria of these network formation games are stable. We are very grateful for the constructive comments of Matt Jackson and an anonymous referee. We also like to thank Vince Crawford, Marco Slikker, Edward Droste, Hans Haller, Dimitrios Diamantaras, and Sudipta Sarangi for comments on previous drafts of this paper.We acknowledge Jay Hogan for his programming support. Part of this research was done while visiting the CentER for Economic Research, Tilburg University, Tilburg, The Netherlands.Financial support from the Netherlands Organization for Scientific Resrarch (NWO), grant B46-390, is gratefully acknowledged.-->,     

Switching from complete to incomplete information

We construct an elementary mechanism [Dutta, B., Sen, A., Vohra, R., 1995. Nash implementation through elementary mechanisms in economic environments. Review of Economic Design 1, 173–203] that Nash implements the constrained Walrasian correspondence. We extend it to incomplete and non-exclusive information economies by enlarging the message space of agents. In addition, measurability restrictions on allocations with respect to prices proper to constrained rational expectations equilibria are imposed in the outcome function. We show that by imposing such restrictions, the mechanism Bayesian implements the constrained rational expectations equilibrium correspondence. This result shows game-theoretic connections between these two market equilibrium concepts. However, these connections are obtained at the price of strong restrictions on the behavior of agents.     

Nash-implementation of competitive equilibria via a bounded mechanism

We deal with the problem of providing incentives for the implementation of competitive outcomes in a pure-exchange economy with finitely many households. We construct a feasible price-quantity mechanism, which fully implements Walras equilibria via Nash equilibria in fairly general environments. Traders’ preferences need neither to be ordered nor continuous. In addition, the mechanism is such that no pure strategy is weakly dominated, hence is bounded (in the sense of Jackson 1992). In particular it makes no use of any integer game.     

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.     

Implementing the nash extension bargaining solution for non-convex problems

Conley and Wilkie (1993) introduced an axiomatization at the Nash extension bargaining solution defined on a domain of comprehensive but not necessarily convex problems. In this paper we present a non-cooperative game which implements the Nash extension solution in subgame perfect equilibria in the limit as the discount rate applied between rounds of play vanishes.     

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.     

Strategic behavior in non-atomic games

In order to remedy the possible loss of strategic interaction in non-atomic games with a societal choice, this study proposes a refinement of Nash equilibrium, strategic equilibrium. Given a non-atomic game, its perturbed game is one in which every player believes that he alone has a small, but positive, impact on the societal choice; and a distribution is a strategic equilibrium if it is a limit point of a sequence of Nash equilibrium distributions of games in which each player’s belief about his impact on the societal choice goes to zero. After proving the existence of strategic equilibria, we show that all of them must be Nash. We also show that all regular equilibria of smooth non-atomic games are strategic. Moreover, it is displayed that in many economic applications, the set of strategic equilibria coincides with that of Nash equilibria of large finite games.     

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.     

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.     

Implementation of Pareto efficient allocations

This paper considers Nash implementation and double implementation of Pareto efficient allocations for production economies. We allow production sets and preferences are unknown to the planner. We present a well-behaved mechanism that fully implements Pareto efficient allocations in Nash equilibrium. The mechanism then is modified to fully doubly implement Pareto efficient allocations in Nash and strong Nash equilibria. The mechanisms constructed in the paper have many nice properties such as feasibility and continuity. In addition, they use finite-dimensional message spaces. Furthermore, the mechanism works not only for three or more agents, but also for two-agent economies.     

Sovereign debt: Reputation, seizure and reputation

The interaction between a creditor and a sovereign debtor is described as a ‘one-shot’ game with discrete actions—total or no debt-repudiation and seizure of asset holding abroad. Possible Nash equilibria where each player chooses an action as to maximize his expected payoff given his beliefs about the other player’s action and the implications of those actions on the players’ trustworthy reputation are identified. However, if reputation losses rise convexly with the players’ relative hostility, partial repudiation and seizure can be the preferred strategies. The preferred repudiation and seizure rates are analyzed under asymmetric and symmetric information about the state of the world. (JEL classification F34)     

Coalitional stability in the location problem with single-dipped preferences: An application of the minimax theorem

This study considers a situation in which agents choose the location of a public facility from a street according to a given mechanism. Agents have single-dipped preferences over a set of feasible locations. We analyze coalitional behavior for any given mechanism for this situation. We identify a necessary and sufficient condition for a mechanism to possess a strong Nash equilibrium by applying the minimax theorem of von Neumann and Morgenstern (1944). We introduce a class of core solutions and show that these solutions are characterized by strong Nash implementability. As a byproduct of these results, we propose a simple mechanism that implements any core solution in strong Nash equilibria.     

Dynamic voluntary provision of public goods with uncertainty: a stochastic differential game model

Fershtman and Nitzan (Eur. Econ. Rev. 35:1057–1067, 1991) presented a continuous dynamic public good game and solved the model for feedback Nash equilibria. Wirl (Eur. J. Polit. Econ. 12:555–560, 1996) extended the model and considered nonlinear strategies. Both models do not include uncertainty and hence neglect an important factor in the theory of public goods. We extend the framework of Nitzan and Fershtman and include a diffusion term. We consider two cases. In the first case, the volatility of the diffusion term is dependent on the current level of the public good. This set-up will in principle lead to the same type of feedback strategies computed under certainty. In the second case, the volatility is dependent on the current rate of public good provision by the agents. The results are qualitatively different. We provide a detailed discussion as well as numerical examples. In particular, we show that in both cases uncertainty signifies the free rider effect.     

Determinacy of equilibrium in outcome game forms

We show the generic finiteness of the number of probability distributions on outcomes induced by Nash equilibria for two-person game forms such that either (i) one of the players has no more than two strategies or (ii) both of the players have three strategies, and (iii) for outcome game forms with three players, each with at most two strategies. Finally, we exhibit an example of a game form with three outcomes and three players for which the Nash equilibria of the associated game induce a continuum of payoffs for an open non-empty set of utility profiles.     

Generalized weak transfer continuity and the Nash equilibrium

This paper introduces the notion of generalized weak transfer continuity and establishes that a bounded, compact locally convex metric quasiconcave and generalized weak transfer continuous game has a Nash equilibrium. Our equilibrium existence result neither implies nor is implied by the existing results in the literature such as those in [Carmona, G., 2011. Understanding some recent existence results for discontinuous games. Economic Theory 48, 31–45], [Prokopovych, P., 2011. On equilibrium existence in payoff secure games. Economic Theory 48, 5–16], [Carmona, G., 2009. An existence result for discontinuous games. Journal of Economic Theory 144, 1333–1340], and [Reny, P.J., 1999. On the existence of pure and mixed strategy Nash equilibria in discontinuous games, Econometrica 67, 1029–1056].     

Electoral control over policy-motivated candidates and their policy biases

We present an election model employing candidates with policy preferences, and show how re-election pressure induces candidates to keep their campaign promises in finitely repeated competitions. The game consists of two periods, each of which comprises an election followed by the winner’s policy implementation. Following the first election, the incumbent may signal his dishonesty by implementing a policy different from his campaign promise. If the citizens care about political honesty, this choice reduces the incumbent’s probability of re-election. An equilibrium is derived which demonstrates that even with term limits, an elected candidate’s deviation from his campaign promise is controlled by the citizens’ monitoring of his performance. Strong public response to the dishonesty of politicians thus serves as a commitment device. The author is grateful to anonymous referees and to the editor of the journal for many valuable comments and suggestions. The author also thanks Masaki Aoyagi, Motonari Kurasawa, Yukihiro Nishimura, Shigehiro Serizawa, Takashi Ui, and participants in the seminars held by the Institute of Statistical Research, Meikai University, Osaka University, University of California, Irvine, and Yokohama National University for their insightful comments.     

Equilibrium allocations of endowment-pretension games in public good economies

In a public good economy where agents' preferences are known but endowments are private information, instituting an allocation rule and asking the agents their initial endowments induces an endowment-pretension game. We analyse the Nash equilibrium allocations of this game and discuss its welfare properties with reference to voluntary contributions allocations. Received: 30 May 2001, Accepted: 23 September 2005 JEL Classification: H41 I am grateful to Murat Sertel for his continuous support and encouragement; to G?ksel Asan and Arunava Sen for their invaluable help. I would also like to thank Fikret Adaman, Ahmet Alkan, Salvador Barberá, Semih Koray, Andrei Ratiu, Muhamet Yíldíz, ünal Zenginobuz, an Associate Editor and two referees of the Review of Economic Design for their enlightening comments on previous drafts. Earlier versions of this paper were written during my stay at Universitat Autónoma de Barcelona and at the Indian Statistical Institute. Both visits have been possible by the kindness of the host institutions and the financial support of the Turkish Academy of Sciences and Serem Ltd. It is a pleasure for me to express my gratitude to all these institutions. Of course, all possible errors are mine.     

The stochastic lake game: A numerical solution

In this paper, we numerically solve a stochastic dynamic programming problem for the solution of a stochastic dynamic game for which there is a potential function. The players select a mean level of control. The state transition dynamics is a function of the current state of the system and a multiplicative noise factor on the control variables of the players. The particular application is for lake water usage. The control variables are the levels of phosphorus discharged (typically by farmers) into the watershed of the lake, and the random shock is the rainfall that washes the phosphorus into the lake. The state of the system is the accumulated level of phosphorus in the lake. The system dynamics are sufficiently nonlinear so that there can be two Nash equilibria. A Skiba-like point can be present in the optimal control solution.We analyze (numerically) how the dynamics and the Skiba-like point change as the variance of the noise (the rain) increases. The numerical analysis uses a result of Dechert (1978. Optimal control problems from second order difference equations. Journal of Economic Theory 19, 50–63) to construct a potential function for the dynamic game. This greatly reduces the computational burden in finding Nash equilibria solutions for the dynamic game.