Roger B. Myerson1
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
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 .................................. -
Regulatory Growth Theory
Regulatory Growth Theory Danxia Xie Tsinghua University December 31, 2017 Abstract This research explores and quantifies the downside of innovations, especially the negative externality of an innovation interacting with the stock of existing innovations. Using two novel datasets, I find that the number of varieties of innovation risks is quadratic in the varieties of innovations that caused them. Based on this new empirical fact, I develop a Regulatory Growth Theory: a new growth model with innovation-induced risks and with a regulator. I model both the innovation risk generating structure and the regulator’sendoge- nous response. This new theory can help to interpret several empirical puzzles beyond the explanatory power of existing models of innovations: (1) skyrocketing expected R&D cost per innovation and (2) exponentially increasing regulation over time. Greater expenditures on regulation and corporate R&D are required to assess the net benefit of an innovation because of “Risk Externality”: negative interaction effects between innovations. The rise of regulation versus litigation, and broader implications for regulatory reform are also discussed. Address: Institute of Economics, Tsinghua University, China. The author’s e-mail address is [email protected]. I am grateful to Gary Becker, Casey Mulligan, Randy Kroszner, Tom Philipson, and Eric Posner for invaluable advice. Also thank Ufuk Akcigit, Olivier Blanchard, Will Cong, Steve Davis, Jeffrey Frankel, Matt Gentzkow, Yehonatan Givati, Michael Greenstone, Lars Hansen, Zhiguo He, Chang- Tai Hsieh, Chad Jones, Greg Kaplan, John List, Bob Lucas, Joel Mokyr, Roger Myerson, Andrei Shleifer, Hugo Sonnenschein, Nancy Stokey, and Hanzhe Zhang for very helpful suggestions and discussions. An early version was presented at Econometric Society 2015 World Congress, Montreal. -
Collusion Constrained Equilibrium
Theoretical Economics 13 (2018), 307–340 1555-7561/20180307 Collusion constrained equilibrium Rohan Dutta Department of Economics, McGill University David K. Levine Department of Economics, European University Institute and Department of Economics, Washington University in Saint Louis Salvatore Modica Department of Economics, Università di Palermo We study collusion within groups in noncooperative games. The primitives are the preferences of the players, their assignment to nonoverlapping groups, and the goals of the groups. Our notion of collusion is that a group coordinates the play of its members among different incentive compatible plans to best achieve its goals. Unfortunately, equilibria that meet this requirement need not exist. We instead introduce the weaker notion of collusion constrained equilibrium. This al- lows groups to put positive probability on alternatives that are suboptimal for the group in certain razor’s edge cases where the set of incentive compatible plans changes discontinuously. These collusion constrained equilibria exist and are a subset of the correlated equilibria of the underlying game. We examine four per- turbations of the underlying game. In each case,we show that equilibria in which groups choose the best alternative exist and that limits of these equilibria lead to collusion constrained equilibria. We also show that for a sufficiently broad class of perturbations, every collusion constrained equilibrium arises as such a limit. We give an application to a voter participation game that shows how collusion constraints may be socially costly. Keywords. Collusion, organization, group. JEL classification. C72, D70. 1. Introduction As the literature on collective action (for example, Olson 1965) emphasizes, groups often behave collusively while the preferences of individual group members limit the possi- Rohan Dutta: [email protected] David K. -
Putting Auction Theory to Work
Putting Auction Theory to Work Paul Milgrom With a Foreword by Evan Kwerel © 2003 “In Paul Milgrom's hands, auction theory has become the great culmination of game theory and economics of information. Here elegant mathematics meets practical applications and yields deep insights into the general theory of markets. Milgrom's book will be the definitive reference in auction theory for decades to come.” —Roger Myerson, W.C.Norby Professor of Economics, University of Chicago “Market design is one of the most exciting developments in contemporary economics and game theory, and who can resist a master class from one of the giants of the field?” —Alvin Roth, George Gund Professor of Economics and Business, Harvard University “Paul Milgrom has had an enormous influence on the most important recent application of auction theory for the same reason you will want to read this book – clarity of thought and expression.” —Evan Kwerel, Federal Communications Commission, from the Foreword For Robert Wilson Foreword to Putting Auction Theory to Work Paul Milgrom has had an enormous influence on the most important recent application of auction theory for the same reason you will want to read this book – clarity of thought and expression. In August 1993, President Clinton signed legislation granting the Federal Communications Commission the authority to auction spectrum licenses and requiring it to begin the first auction within a year. With no prior auction experience and a tight deadline, the normal bureaucratic behavior would have been to adopt a “tried and true” auction design. But in 1993 there was no tried and true method appropriate for the circumstances – multiple licenses with potentially highly interdependent values. -
Informational Size and Incentive Compatibility
Econometrica, Vol. 70, No. 6 (November, 2002), 2421–2453 INFORMATIONAL SIZE AND INCENTIVE COMPATIBILITY By Richard McLean and Andrew Postlewaite1 We examine a general equilibrium model with asymmetrically informed agents. The presence of asymmetric information generally presents a conflict between incentive com- patibility and Pareto efficiency. We present a notion of informational size and show that the conflict between incentive compatibility and efficiency can be made arbitrarily small if agents are of sufficiently small informational size. Keywords: Incentive compatibility, mechanism design, incomplete information. 1 introduction The incompatibility of Pareto efficiency and incentive compatibility is a central theme in economics and game theory. The issues associated with this incompatibility are particularly important in the design of resource allocation mechanisms in the presence of asymmetrically informed agents where the need to acquire information from agents in order to compute efficient outcomes and the incentives agents have to misrepresent that information for personal gain come into conflict. Despite a large literature that focuses on these issues, there has been little work aimed at understanding those situations in which informational asymmetries are quantitatively important. Virtually every transaction is characterized by some asymmetry of information: any investor who buys or sells a share of stock generally knows something rel- evant to the value of the share that is not known to the person on the other side of the transaction. In order to focus on more salient aspects of the problem, many models (rightly) ignore the incentive problems associated with informa- tional asymmetries in the belief that, for the problem at hand, agents are “infor- mationally small.” However, few researchers have investigated the circumstances under which an analysis that ignores these incentive problems will yield results similar to those obtained when these problems are fully accounted for. -
The Case of Nepal Page 20 Shikha Silwal
The Economics of Vol. 8, No. 2 (2013) Peace and Security Articles Journal William C. Bunting on conflict over fundamental rights © www.epsjournal.org.uk Boris Gershman on envy and conflict ISSN 1749-852X Shikha Silwal on the spatial-temporal spread of civil war in Nepal A publication of Smita Ramnarain on the role of women’s cooperatives in Nepalese Economists for Peace peacebuilding and Security (U.K.) Guro Lien on the political economy of security sector reform Editors Jurgen Brauer, Georgia Regents University, Augusta, GA, USA J. Paul Dunne, University of Cape Town, South Africa The Economics of Peace and Security Journal © www.epsjournal.org.uk, ISSN 1749-852X A publication of Economists for Peace and Security (U.K.) Editors Aims and scope Jurgen Brauer Georgia Regents University, Augusta, GA, USA This journal raises and debates all issues related to the political economy of personal, communal, national, J. Paul Dunne international, and global conflict, peace and security. The scope includes implications and ramifications of University of Cape Town, South Africa conventional and nonconventional conflict for all human and nonhuman life and for our common habitat. Web editor Special attention is paid to constructive proposals for conflict resolution and peacemaking. While open to Thea Harvey-Barratt Economists for Peace and Security, Annandale-upon- noneconomic approaches, most contributions emphasize economic analysis of causes, consequences, and Hudson, NY, USA possible solutions to mitigate conflict. Book review editor The journal is aimed at specialist and nonspecialist readers, including policy analysts, policy and Elisabeth Sköns decisionmakers, national and international civil servants, members of the armed forces and of peacekeeping Stockholm International Peace Research Institute, services, the business community, members of nongovernmental organizations and religious institutions, and Stockholm, Sweden others. -
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. -
3 Nobel Laureates to Honor UCI's Duncan Luce
3 Nobel laureates to honor UCI’s Duncan Luce January 25th, 2008 by grobbins Three recent winners of the Nobel Prize in economics will visit UC Irvine today and Saturday to honor mathematician-psychologist Duncan Luce, who shook the economics world 50 years ago with a landmark book on game theory. Game theory is the mathematical study of conflict and interaction among people. Luce and his co-author, Howard Raiffa, laid out some of the most basic principles and insights about the field in their book, “Games and Decisions: Introductions and Critical Survey.” That book, and seminal equations Luce later wrote that helped explain and predict a wide range of human behavior, including decision-making involving risk, earned him the National Medal of Science, which he received from President Bush in 2005. (See photo.) UCI mathematican Don Saari put together a celebratory conference to honor both Luce and Raiffa, and he recruited some of the world’s best-known economic scientists. It’s one of the largest such gatherings since UCI hosted 17 Nobel laureates in October 1996. “Luce and Raiffa’s book has been tremendously influential and we wanted to honor them,” said Saari, a member of the National Academy of Sciences. Luce said Thursday night, “This is obviously very flattering, and it’s amazing that the book is sufficiently alive that people would want to honor it.” The visitors scheduled to attended the celebratory conference include: Thomas Schelling, who won the 2005 Nobel in economics for his research on game theory Roger Myerson and Eric Maskin, who shared the 2007 Nobel in economics for their work in design theory. -
Chapter 11 Eric S. Maskin
Chapter 11 Eric S. Maskin BIOGRAPHY ERIC S. MASKIN, USA ECONOMICS, 2007 When seeking a solution to a problem it is possible, particularly in a non-specific field such as economics, to come up with several plausible answers. One may stand out as the most likely candi- date, but it may also be worth pursuing other options – indeed, this is a central strand of John Nash’s game theory, romantically illustrated in the film A Beautiful Mind. R. M. Solow et al. (eds.), Economics for the Curious © Foundation Lindau Nobelprizewinners Meeting at Lake Constance 2014 160 ERIC S. MASKIN Eric Maskin, along with Leonid Hurwicz and Roger Myerson, was awarded the 2007 Nobel Prize in Economics for their related work on mechanism design theory, a mathematical system for analyzing the best way to align incentives between parties. This not only helps when designing contracts between individuals but also when planning effective government regulation. Maskin’s contribution was the development of implementa- tion theory for achieving particular social or economic goals by encouraging conditions under which all equilibria are opti- mal. Maskin came up with his theory early in his career, after his PhD advisor, Nobel Laureate Kenneth Arrow, introduced him to Leonid Hurwicz. Maskin explains: ‘I got caught up in a problem inspired by the work of Leo Hurwicz: under what cir- cumstance is it possible to design a mechanism (that is, a pro- cedure or game) that implements a given social goal, or social choice rule? I finally realized that monotonicity (now sometimes called ‘Maskin monotonicity’) was the key: if a social choice rule doesn't satisfy monotonicity, then it is not implementable; and if it does satisfy this property it is implementable provided no veto power, a weak requirement, also holds. -
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. -
Leonid Hurwicz, Eric Maskin, and Roger Myerson
The Nobel Prize in Economics 2007: Background on Contributions to the Theory of Mechanism Design by Leonid Hurwicz, Eric Maskin, and Roger Myerson. The theories of mechanism design and implementation provide a strategic analysis of the operation of various institutions for social decision making, with applications ranging from modeling election procedures to market design and the provision of public goods. The models use game theoretic tools to try to understand how the design of an institution relates to eventual outcomes when self-interested individuals, who may have private information, interact through the given institution. For example, the type of question addressed by the theory is: ``How do the specific rules of an auction relate to outcomes in terms of which agents win objects and at what prices, as a function of their private information about the value of those objects?’’ Some of the early roots of the theories of mechanism design and implementation can be traced to the Barone, Mises, von Hayek, Lange and Lerner debates over the feasibility of a centralized socialist economy. These theories also have roots in the question of how to collect decentralized information and allocate resources which motivated early Walrasian tatonnement processes, and the later Tjalling Koopmans' (1951) formalization of adjustment processes as well as Arrow-Hurwicz gradient process. The more modern growth of these theories, both in scope and application, came from the explicit incorporation of incentive issues. Early mention of incentive issues, and what appears to be the first coining of the term ``incentive compatibility,'' are due to Hurwicz (1960). The fuller treatment of incentives then came into its own in the classic paper of Hurwicz (1972). -
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.......