Privacy and Truthful Equilibrium Selection for Aggregative Games
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The Determinants of Efficient Behavior in Coordination Games
The Determinants of Efficient Behavior in Coordination Games Pedro Dal B´o Guillaume R. Fr´echette Jeongbin Kim* Brown University & NBER New York University Caltech May 20, 2020 Abstract We study the determinants of efficient behavior in stag hunt games (2x2 symmetric coordination games with Pareto ranked equilibria) using both data from eight previous experiments on stag hunt games and data from a new experiment which allows for a more systematic variation of parameters. In line with the previous experimental literature, we find that subjects do not necessarily play the efficient action (stag). While the rate of stag is greater when stag is risk dominant, we find that the equilibrium selection criterion of risk dominance is neither a necessary nor sufficient condition for a majority of subjects to choose the efficient action. We do find that an increase in the size of the basin of attraction of stag results in an increase in efficient behavior. We show that the results are robust to controlling for risk preferences. JEL codes: C9, D7. Keywords: Coordination games, strategic uncertainty, equilibrium selection. *We thank all the authors who made available the data that we use from previous articles, Hui Wen Ng for her assistance running experiments and Anna Aizer for useful comments. 1 1 Introduction The study of coordination games has a long history as many situations of interest present a coordination component: for example, the choice of technologies that require a threshold number of users to be sustainable, currency attacks, bank runs, asset price bubbles, cooper- ation in repeated games, etc. In such examples, agents may face strategic uncertainty; that is, they may be uncertain about how the other agents will respond to the multiplicity of equilibria, even when they have complete information about the environment. -
Lecture Notes
GRADUATE GAME THEORY LECTURE NOTES BY OMER TAMUZ California Institute of Technology 2018 Acknowledgments These lecture notes are partially adapted from Osborne and Rubinstein [29], Maschler, Solan and Zamir [23], lecture notes by Federico Echenique, and slides by Daron Acemoglu and Asu Ozdaglar. I am indebted to Seo Young (Silvia) Kim and Zhuofang Li for their help in finding and correcting many errors. Any comments or suggestions are welcome. 2 Contents 1 Extensive form games with perfect information 7 1.1 Tic-Tac-Toe ........................................ 7 1.2 The Sweet Fifteen Game ................................ 7 1.3 Chess ............................................ 7 1.4 Definition of extensive form games with perfect information ........... 10 1.5 The ultimatum game .................................. 10 1.6 Equilibria ......................................... 11 1.7 The centipede game ................................... 11 1.8 Subgames and subgame perfect equilibria ...................... 13 1.9 The dollar auction .................................... 14 1.10 Backward induction, Kuhn’s Theorem and a proof of Zermelo’s Theorem ... 15 2 Strategic form games 17 2.1 Definition ......................................... 17 2.2 Nash equilibria ...................................... 17 2.3 Classical examples .................................... 17 2.4 Dominated strategies .................................. 22 2.5 Repeated elimination of dominated strategies ................... 22 2.6 Dominant strategies .................................. -
Muddling Through: Noisy Equilibrium Selection*
Journal of Economic Theory ET2255 journal of economic theory 74, 235265 (1997) article no. ET962255 Muddling Through: Noisy Equilibrium Selection* Ken Binmore Department of Economics, University College London, London WC1E 6BT, England and Larry Samuelson Department of Economics, University of Wisconsin, Madison, Wisconsin 53706 Received March 7, 1994; revised August 4, 1996 This paper examines an evolutionary model in which the primary source of ``noise'' that moves the model between equilibria is not arbitrarily improbable mutations but mistakes in learning. We model strategy selection as a birthdeath process, allowing us to find a simple, closed-form solution for the stationary distribution. We examine equilibrium selection by considering the limiting case as the population gets large, eliminating aggregate noise. Conditions are established under which the risk-dominant equilibrium in a 2_2 game is selected by the model as well as conditions under which the payoff-dominant equilibrium is selected. Journal of Economic Literature Classification Numbers C70, C72. 1997 Academic Press Commonsense is a method of arriving at workable conclusions from false premises by nonsensical reasoning. Schumpeter 1. INTRODUCTION Which equilibrium should be selected in a game with multiple equilibria? This paper pursues an evolutionary approach to equilibrium selection based on a model of the dynamic process by which players adjust their strategies. * First draft August 26, 1992. Financial support from the National Science Foundation, Grants SES-9122176 and SBR-9320678, the Deutsche Forschungsgemeinschaft, Sonderfor- schungsbereich 303, and the British Economic and Social Research Council, Grant L122-25- 1003, is gratefully acknowledged. Part of this work was done while the authors were visiting the University of Bonn, for whose hospitality we are grateful. -
Collusion and Equilibrium Selection in Auctions∗
Collusion and equilibrium selection in auctions∗ By Anthony M. Kwasnica† and Katerina Sherstyuk‡ Abstract We study bidder collusion and test the power of payoff dominance as an equi- librium selection principle in experimental multi-object ascending auctions. In these institutions low-price collusive equilibria exist along with competitive payoff-inferior equilibria. Achieving payoff-superior collusive outcomes requires complex strategies that, depending on the environment, may involve signaling, market splitting, and bid rotation. We provide the first systematic evidence of successful bidder collusion in such complex environments without communication. The results demonstrate that in repeated settings bidders are often able to coordinate on payoff superior outcomes, with the choice of collusive strategies varying systematically with the environment. Key words: multi-object auctions; experiments; multiple equilibria; coordination; tacit collusion 1 Introduction Auctions for timber, automobiles, oil drilling rights, and spectrum bandwidth are just a few examples of markets where multiple heterogeneous lots are offered for sale simultane- ously. In multi-object ascending auctions, the applied issue of collusion and the theoretical issue of equilibrium selection are closely linked. In these auctions, bidders can profit by splitting the markets. By acting as local monopsonists for a disjoint subset of the objects, the bidders lower the price they must pay. As opposed to the sealed bid auction, the ascending auction format provides bidders with the -
Sensitivity of Equilibrium Behavior to Higher-Order Beliefs in Nice Games
Forthcoming in Games and Economic Behavior SENSITIVITY OF EQUILIBRIUM BEHAVIOR TO HIGHER-ORDER BELIEFS IN NICE GAMES JONATHAN WEINSTEIN AND MUHAMET YILDIZ Abstract. We consider “nice” games (where action spaces are compact in- tervals, utilities continuous and strictly concave in own action), which are used frequently in classical economic models. Without making any “richness” assump- tion, we characterize the sensitivity of any given Bayesian Nash equilibrium to higher-order beliefs. That is, for each type, we characterize the set of actions that can be played in equilibrium by some type whose lower-order beliefs are all as in the original type. We show that this set is given by a local version of interim correlated rationalizability. This allows us to characterize the robust predictions of a given model under arbitrary common knowledge restrictions. We apply our framework to a Cournot game with many players. There we show that we can never robustly rule out any production level below the monopoly production of each firm.Thisiseventrueifweassumecommonknowledgethat the payoffs are within an arbitrarily small neighborhood of a given value, and that the exact value is mutually known at an arbitrarily high order, and we fix any desired equilibrium. JEL Numbers: C72, C73. This paper is based on an earlier working paper, Weinstein and Yildiz (2004). We thank Daron Acemoglu, Pierpaolo Battigalli, Tilman Börgers, Glenn Ellison, Drew Fudenberg, Stephen Morris, an anonymous associate editor, two anonymous referees, and the seminar participants at various universities and conferences. We thank Institute for Advanced Study for their generous support and hospitality. Yildiz also thanks Princeton University and Cowles Foundation of Yale University for their generous support and hospitality. -
Revelation Principles in Multistage Games∗
Revelation Principles in Multistage Games Takuo Sugaya and Alexander Wolitzky Stanford GSB and MIT September 22, 2017 Abstract We study the revelation principle in multistage games for perfect Bayesian equi- libium and sequential equilibrium. The question of whether or not the revelation principle holds is subtle, as expanding players’ opportunities for communication ex- pands the set of consistent beliefs at off-path information sets. In settings with adverse selection but no moral hazard, Nash, perfect Bayesian, and sequential equilibrium are essentially equivalent, and a virtual-implementation version of the revelation principle holds. In general, we show that the revelation principle holds for weak perfect Bayesian equilibrium and for a stronger notion of perfect Bayesian equilibrium introduced by Myerson (1986). Our main result is that the latter notion of perfect Bayesian equilib- rium is outcome-equivalent to sequential equilibrium when the mediator can tremble; this provides a revelation principle for sequential equilibrium. When the mediator cannot tremble, the revelation principle for sequential equilibrium can fail. Preliminary. Comments Welcome. For helpful comments, we thank Drew Fudenberg, Dino Gerardi, Shengwu Li, Roger Myerson, Alessandro Pavan, Harry Pei, Juuso Toikka, and Bob Wilson. 1 Introduction The revelation principle states that any social choice function that can be implemented by any mechanism can also be implemented by a canonical mechanism where communication between players and the mechanism designer or mediator takes a circumscribed form: players communicate only their private information to the mediator, and the mediator communi- cates only recommended actions to the players. This cornerstone of modern microeconomics was developed by several authors in the 1970s and early 1980s, reaching its most general formulation in the principal-agent model of Myerson (1982), which treats one-shot games with both adverse selection and moral hazard. -
The Revelation Principle for Mechanism Design with Reporting Costs
The Revelation Principle for Mechanism Design with Reporting Costs ANDREW KEPHART, Duke University VINCENT CONITZER, Duke University The revelation principle is a key tool in mechanism design. It allows the designer to restrict attention to the class of truthful mechanisms, greatly facilitating analysis. This is also borne out in an algorithmic sense, al- lowing certain computational problems in mechanism design to be solved in polynomial time. Unfortunately, when not every type can misreport every other type (the partial verification model), or—more generally— misreporting can be costly, the revelation principle can fail to hold. This also leads to NP-hardness results. The primary contribution of this paper consists of characterizations of conditions under which the revelation principle still holds when misreporting can be costly. (These are generalizations of conditions given earlier for the partial verification case [Green and Laffont 1986; Yu 2011].) We also study associated computational problems. Additional Key Words and Phrases: automated mechanism design, signaling costs, partial verification, rev- elation principle 1. INTRODUCTION Mechanism design concerns making decisions based on the private information of one or more agents, who will not report this information truthfully if they do not see this to be in their interest. The goal is to define a mechanism—a game to be played by the agent(s)—that defines actions for the agents to take and maps these actions to outcomes, such that in equilibrium, the agents’ true types map to outcomes as de- sired. This may, at first, appear to leave us in the unmanageable situation of having to search through all possible games we could define. -
Theory of Mechanism Design
Theory of Mechanism Design Debasis Mishra1 April 14, 2020 1Economics and Planning Unit, Indian Statistical Institute, 7 Shahid Jit Singh Marg, New Delhi 110016, India, E-mail: [email protected] 2 Contents 1 Introduction to Mechanism Design7 1.0.1 Private Information and Utility Transfers................8 1.0.2 Examples in Practice........................... 10 1.1 A General Model of Preferences......................... 11 1.2 Social Choice Functions and Mechanisms.................... 14 1.3 Dominant Strategy Incentive Compatibility................... 16 1.4 Bayesian Incentive Compatibility........................ 18 1.4.1 Failure of revelation principle...................... 21 2 Mechanism Design with Transfers and Quasilinearity 23 2.1 A General Model................................. 24 2.1.1 Allocation Rules............................. 24 2.1.2 Payment Functions............................ 26 2.1.3 Incentive Compatibility.......................... 27 2.1.4 An Example................................ 27 2.1.5 Two Properties of Payments....................... 28 2.1.6 Efficient Allocation Rule is Implementable............... 29 2.2 The Vickrey-Clarke-Groves Mechanism..................... 32 2.2.1 Illustration of the VCG (Pivotal) Mechanism.............. 33 2.2.2 The VCG Mechanism in the Combinatorial Auctions......... 35 2.2.3 The Sponsored Search Auctions..................... 37 2.3 Affine Maximizer Allocation Rules are Implementable............. 38 2.3.1 Public Good Provision.......................... 40 2.3.2 Restricted and Unrestricted Type Spaces................ 41 3 3 Mechanism Design for Selling a Single Object 45 3.1 The Single Object Auction Model........................ 45 3.1.1 The Vickrey Auction........................... 45 3.1.2 Facts from Convex Analysis....................... 46 3.1.3 Monotonicity and Revenue Equivalence................. 49 3.1.4 The Efficient Allocation Rule and the Vickrey Auction....... -
Truthful Revelation Mechanisms for Simultaneous Common Agency Games† 132 Truthful Revelation Mechanisms for Simultaneous Common A
American Economic Journal: Microeconomics 2 (May 2010): 132–190 http://www.aeaweb.org/articles.php?doi 10.1257/mic.2.2.132 = Contents Truthful Revelation Mechanisms for Simultaneous Common Agency Games† 132 Truthful Revelation Mechanisms for Simultaneous Common A. Simple Menu-Auction Example 136 Agency Games† I. The Environment 140 II. Simple Revelation Mechanisms 143 By Alessandro Pavan and Giacomo Calzolari* III. Using Revelation Mechanisms in Applications 150 A. Competition in Nonlinear Tariffs 150 B. Menu Auctions 156 We introduce new revelation mechanisms for simultaneous common C. Moral Hazard 159 agency games which, although they do not always permit a complete IV. Enriched Mechanisms 161 equilibrium characterization, do facilitate the characterization of A. Non-Markov Strategies 161 the equilibrium outcomes that are typically of interest in applica- tions. We then show how these mechanisms can be used in applica- B. Mixed Strategies 163 tions such as menu auctions, competition in nonlinear tariffs, and V. Conclusions 166 moral hazard settings. Lastly, we show how one can enrich the rev- Appendix 1: Take-It-or-Leave-It-Offer Equilibria in the Menu-Auction Example in the Introduction elation mechanisms, albeit at a cost of an increase in complexity, 167 to characterize all possible equilibrium outcomes, including those Appendix 2: Omitted Proofs 168 sustained by non-Markov strategies and or mixed-strategy profiles. REFERENCES 189 / JEL C72, D82, D86 ( ) any economic environments can be modelled as common agency games—that M is, games where multiple principals contract simultaneously and noncoopera- tively with the same agent.1 Despite their relevance for applications, the analysis of these games has been made difficult by the fact that one cannot safely assume that the agent selects a contract with each principal by simply reporting his “type” i.e., his ( exogenous payoff-relevant information . -
Lecture 1: Ascending and Ex Post Incentive Compatible Mechanisms
CS364B: Frontiers in Mechanism Design Lecture #1: Ascending and Ex Post Incentive Compatible Mechanisms∗ Tim Roughgardeny January 8, 2014 1 Introduction These twenty lectures cover advanced topics in mechanism design. They assume familiarity with some of the material covered in the instructor's CS364A course | specifically, lectures 2{4 and 7{9. Recall that mechanism design is the \science of rule-making." The goal is to understand how to design systems with strategic participants | autonomous decision-makers whose objectives are generally different from the the designer's | that have good performance guarantees. For example, a mechanism designer might want to compute a socially efficient allocation of scarce resources or raise significant revenue, while a mechanism participant only cares about its own utility. 2 Course Outline The plan is to cover the following five topics. 1. (6 lectures.) Welfare-maximization in combinatorial auctions: tractable special cases and ascending implementations. 2. (4 lectures.) Welfare-maximization in combinatorial auctions: dominant-strategy ap- proximation mechanisms for NP-hard cases. 3. (3 lectures.) Welfare-maximization in combinatorial auctions: better guarantees for weaker solutions concepts (undominated strategies and Bayes-Nash equilibria). ∗ c 2014, Tim Roughgarden. yDepartment of Computer Science, Stanford University, 462 Gates Building, 353 Serra Mall, Stanford, CA 94305. Email: [email protected]. 1 4. (4 lectures.) The price of anarchy in simple auctions. 5. (3 lectures.) Revenue-maximization in multi-parameter settings. 3 Review: The k-Vickrey Auction Let's recall a basic example from last quarter. Scenario #1: • k identical items (even k = 1 is interesting); • each bidder is unit demand, meaning it only wants one item; • each bidder has a private valuation vi for a item. -
Strategy-Proofness in Experimental Matching Markets
WINPEC Working Paper Series No.E1913 August 2019 Strategy-proofness in experimental matching markets Pablo Guillen and Robert F. Veszteg Waseda INstitute of Political EConomy Waseda University Tokyo, Japan Strategy-proofness in experimental matching markets Pablo Guillen∗ Robert´ F. Vesztegy The University of Sydney Waseda University September 21, 2019 Abstract We introduce two novel matching mechanisms, Reverse Top Trading Cy- cles (RTTC) and Reverse Deferred Acceptance (RDA), with the purpose of challenging the idea that the theoretical property of strategy-proofness in- duces high rates of truth-telling in economic experiments. RTTC and RDA are identical to the celebrated Top Trading Cycles (TTC) and Deferred Ac- ceptance (DA) mechanisms, respectively, in all their theoretical properties except that their dominant-strategy equilibrium is to report one’s preferences in the order opposite to the way they were induced. With the focal truth- telling strategy being out of equilibrium, we are able to perform a clear mea- surement of how much of the truth-telling reported for strategy-proof mech- anisms is compatible with rational behavior and how much of it is caused by confused decision-makers following a default (very focal) strategy without understanding the structure of the game. In a school-allocation setting, we find that roughly half of the observed truth-telling under TTC and DA is the result of na¨ıve (non-strategic) behavior. Only 13-29% of participants’ ac- tions in RTTC and RDA are compatible with rational behavior. Further than that, by looking at the responses of those seemingly rational participants in control tasks, it becomes clear that even them lack a basic understanding of the game incentives. -
Lectures in Contract Theory1
Lectures in Contract Theory1 Steve Tadelis and Ilya Segal2 UC Berkeley and Stanford University Preliminary and Incomplete December 2005 1These notes were prepared for a second year graduate course in Contract theory at Stanford University (Econ 282/291) and UC Berkeley (Econ 206). They are preliminary and incomplete. Thanks also to Debbie Johnston for typing the first version and to Scott Hemphill for excellent research assistance. 2Copyright c 1998-2005 by Steven Tadelis and Ilya Segal. All rights reserved. No part of these° notes may be reproduced in any form by any electronuic or mechanical means without writen permission from the author. Contents IIntroduction 5 0.1Tradewithsmallnumbersofagents............... 6 0.2 Incentives ............................. 7 0.3BoundedRationality....................... 8 0.4Contracts,Mechanisms,Institutions............... 8 II Hidden Information 10 1 The Principal-Agent Model 12 1.1Setup................................ 12 1.1.1 Preferences........................ 12 1.1.2 Contracting........................ 13 1.2Single-CrossingandtheMonotonicityofChoice........ 13 1.3TheFullInformationBenchmark................ 16 1.4TheRevelationPrinciple..................... 18 1.5SolutionwithTwoTypes..................... 20 1.5.1 ManyDiscreteTypes................... 24 1.6SolutionwithaContinuumofTypes.............. 25 1.6.1 TheRelaxedProblem................... 28 1.6.2 Whattodoifmonotonicitybinds(technical)...... 31 1.7ApplicationsoftheModel.................... 32 1.7.1 SecondDegreePriceDiscrimination..........