Tilburg University Auction Theory For
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Loss Aversion and Sunk Cost Sensitivity in All-Pay Auctions for Charity: Experimental Evidence∗
Loss Aversion and Sunk Cost Sensitivity in All-pay Auctions for Charity: Experimental Evidence∗ Joshua Fostery Economics Department University of Wisconsin - Oshkosh August 30, 2017 Abstract All-pay auctions have demonstrated an extraordinary ability at raising money for charity. One mechanism in particular is the war of attrition, which frequently generates revenue well beyond what is theoretically predicted with rational bidders. However, what motivates the behavioral response in bidders remains unclear. By imposing charity auction incentives in the laboratory, this paper uses controlled experiments to consider the effects of loss aversion and sunk cost sensitivity on bidders’ willingness to contribute. The results indicate that revenues in incremental bidding mechanisms, such as the war of attrition, rely heavily on bidders who are sunk cost sensitive. It is shown this behavioral response can be easily curbed with a commitment device which drastically lowers contributions below theoretical predictions. A separate behavioral response due to loss aversion is found in the sealed-bid first-price all-pay auction, which reduces bidders’ willingness to contribute. These findings help explain the inconsistencies in revenues from previous all-pay auction studies and indicate a mechanism preference based on the distribution of these behavioral characteristics. Keywords: Auctions, Market Design, Charitable Giving JEL Classification: C92, D03, D44, D64 ∗I would like to thank Cary Deck, Amy Farmer, Jeffrey Carpenter, Salar Jahedi, Li Hao, and seminar participants at the University of Arkansas, ESA World Meetings, ESA North America Meetings, and the SEA Annual Meetings for their helpful comments at various stages of the development of this project. yContact the author at [email protected]. -
Robust Market Design: Information and Computation
ROBUST MARKET DESIGN: INFORMATION AND COMPUTATION A DISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Inbal Talgam-Cohen December 2015 Abstract A fundamental problem in economics is how to allocate precious and scarce resources, such as radio spectrum or the attention of online consumers, to the benefit of society. The vibrant research area of market design, recognized by the 2012 Nobel Prize in economics, aims to develop an engineering science of allocation mechanisms based on sound theoretical foundations. Two central assumptions are at the heart of much of the classic theory on resource allocation: the common knowledge and substitutability assumptions. Relaxing these is a prerequisite for many real-life applications, but involves significant informational and computational challenges. The starting point of this dissertation is that the computational paradigm offers an ideal toolbox for overcoming these challenges in order to achieve a robust and applicable theory of market design. We use tools and techniques from combinatorial optimization, randomized algo- rithms and computational complexity to make contributions on both the informa- tional and computational fronts: 1. We design simple mechanisms for maximizing seller revenue that do not rely on common knowledge of buyers' willingness to pay. First we show that across many different markets { including notoriously challenging ones in which the goods are heterogeneous { the optimal revenue benchmark can be surpassed or approximated by adding buyers or limiting supplies, and then applying the standard Vickrey (second-price) mechanism. We also show how, by removing the common knowledge assumption, the classic theory of revenue maximiza- tion expands to encompass the realistic but complex case in which buyers are interdependent in their willingness to pay. -
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. -
Lecture Notes
601.436/636 Algorithmic Game Theory Lecturer: Michael Dinitz Topic: Online Auctions Date: 4/28/20 Scribe: Michael Dinitz 24.1 Introduction So far all of our mechanism have been \one-shot": we run an auction by soliciting bids and then deciding on an outcome and prices. This is intuitively a pretty good model of what we think of as an \auction". But let's think of another setting: we're selling items in a store. Then players will enter our store, make us an offer, and leave the store. Clearly if we sell an item to a player then we cannot later sell the same item to someone else, and if a player leaves the store then we cannot afterwards sell them the item. So our decisions are irrevocable. This is a classical setting for online algorithms, so today we'll be considering online mechanisms which combine online algorithms with incentives. 24.2 Example Suppose that we're selling two identical items. Each bidder wants one item (they don't care which) and has a valuation for how much they value an item (the same value for both, since they're identical), but also has an arrival and departure time. Suppose that there are three bidders. Bidder 1 has a valuation of 100, arrival time of noon (12pm), and departure time of 2pm. Bidder 2 has valuation 80, arrival time of noon, and departure time of 2pm. Bidder 3 has valuation of 60, arrival time of 1pm, and departure time of 2pm. If we were in the old setting, without arrival and departure times, it's pretty easy to use VCG to figure out what to do. -
English Versus Vickrey Auctions with Loss Averse Bidders
English versus Vickrey Auctions with Loss Averse Bidders Jonas von Wangenheim School of Business & Economics Discussion Paper Economics 2019/1 English versus Vickrey Auctions with Loss Averse Bidders∗ Jonas von Wangenheimyz December 19, 2018 Abstract Evidence suggests that people evaluate outcomes relative to expecta- tions. I analyze this expectation-based loss aversion [K}oszegiand Rabin (2006, 2009)] in the context of dynamic and static auctions, where the ref- erence point is given by the (endogenous) equilibrium outcome. If agents update their reference point during the auction, the arrival of informa- tion crucially affects equilibrium behavior. Consequently, I show that| even with independent private values|the Vickrey auction yields strictly higher revenue than the English auction, violating the well known revenue equivalence. Thus, dynamic loss aversion offers a novel explanation for empirically observed differences between these auction formats. Keywords: Vickrey auction, English auction, expectation-based loss aver- sion, revenue equivalence, dynamic loss aversion, personal equilibrium JEL classification: D03, D44 ∗I thank Yves Breitmoser, Fran¸coiseForges, Matthias Hammer, Paul Heidhues, Radosveta Ivanova-Stenzel, Johannes Johnen, Thomas Mariotti, Antonio Rosato, Thomas Schacherer, Ran Spiegler, Roland Strausz, and Georg Weizs¨acker for helpful comments, as well as participants at the 11th World Congress of the Econometric Society (Montreal), the 2015 EEA conference (Mannheim), the Applied Theory Workshop at Toulouse School of Economics, the 2016 EARIE conference (Lisbon), the CRC conference in Berlin, the ZEW Research Seminar, and the 2017 Annual Conference of the Verein f¨urSocialpolitik (Vienna). I gratefully acknowledge financial support of the German Research Foundation through CRC TRR 190 and RTG 1659. -
Spectrum Auctions from the Perspective of Matching
Spectrum Auctions from the Perspective of Matching Paul Milgrom and Andrew Vogt May 5, 2021 1 Introduction In July 1994, the United States Federal Communications Commission (FCC) conducted the first economist-designed auction for radio spectrum licenses. In the years since, governments worldwide have come to rely on auction mecha- nisms to allocate { and reallocate { rights to use electromagnetic frequencies. Over the same period, novel uses for spectrum have dramatically increased both the demand for licenses and auction prices, drawing continued attention to the nuances of spectrum markets and driving the development of spectrum auction design. In August 2017, the FCC completed the Broadcast Incentive Auction, a two-sided repurposing of an endogenously-determined quantity of spectrum that ranks among the most complex feats of economic engineering ever under- taken. The next generations of mobile telecommunications are poised to extend this growth, and to demand further innovation in the markets and algorithms that are used to assign spectrum licenses. What does all of this have to do with matching theory? Spectrum auctions differ from canonical matching problems in meaningful ways. Market designers often emphasize that a key element of matching markets is the presence of preferences on both sides of the market. In a marriage, for example, it is not enough that you choose your spouse; your spouse must also choose you. This two-sided choice structure applies also to matches between students and schools and between firms and workers, but not to matches between telecommunications companies and radio spectrum licenses. It is a different matching element that is often critically important in ra- dio spectrum auctions. -
The Ability of Dutch Foreclosure Auctions in Maximizing Seller Revenue
The ability of Dutch foreclosure auctions in maximizing seller revenue Why Dutch foreclosure auction prices fall short of the market price Martijn Duijster 0475211 Group 2 Finance, semester 2, 2013-2014 17-7-2014 Bachelor thesis Economics and Business - specialization Finance and Organization Sander Onderstal Faculty of Economics and Business University of Amsterdam Index Abstract 3 1. Introduction 3 2. Dutch real estate auctions 4 3. Literature review 6 3.1. Types of auctions 6 3.2. The revenue equivalence results 8 3.3. Violations of the revenue equivalence result assumption 8 3.3.1. Information asymmetry 9 3.3.2. Competition 10 3.3.3. Bidder affiliation and the winner’s curse 11 4. Hypotheses 12 5. Research method 13 6. Results 15 6.1.. Explanation of the results 17 6.1.1. Information asymmetry 17 6.1.2. Competition 18 6.1.3 Solutions to improve competition 18 6.1.4. Transaction costs 19 6.1.5 Conflicts of interest between seller and owner 21 7. Conclusion 22 References 24 Appendices 26 2 Abstract The revenues in Dutch foreclosure auctions are compared to the market values of the properties. The discount rate is calculated which states the difference between the auction price and the market price. Foreclosure auctions in the Netherlands fail to receive an auction price close to the market price; the average discount rate with auction cost included in the auction price is about 20% and the discount rate when auction costs are excluded is about 27%. Asymmetric information, lack of competition, transaction costs and conflicts of interest may be attributable to this price gap. -
Perspectives on the December 2019 Auction of Numbers in the 833 Numbering Plan Area
Perspectives on the December 2019 Auction of Numbers in the 833 Numbering Plan Area Report to the FCC of the NANC Toll Free Assignment Modernization (TFAM) Work Group July 14, 2020 Report to the NANC of the TFAM Working Group Perspectives on the December 2019 833 Auction July 14, 2020 Table of Contents Perspectives on the December 2019 Auction of Numbers in the 833 Numbering Plan Area ................................................. 1 Assignment ..................................................................................................................................... 1 Background ..................................................................................................................................... 3 Approach ......................................................................................................................................... 4 Resources Used ............................................................................................................................... 5 Deliberation Process ....................................................................................................................... 6 Issue Group A: Perspectives on Education and Outreach, the Application Process, and Up-front Payments ......................................................................................................................................... 7 Issue 2: Evaluate the education and outreach efforts undertaken throughout the 833 Auction process...................................................................................................................................... -
Auction Theory
Auction Theory Jonathan Levin October 2004 Our next topic is auctions. Our objective will be to cover a few of the main ideas and highlights. Auction theory can be approached from different angles – from the perspective of game theory (auctions are bayesian games of incomplete information), contract or mechanism design theory (auctions are allocation mechanisms), market microstructure (auctions are models of price formation), as well as in the context of different applications (procure- ment, patent licensing, public finance, etc.). We’re going to take a relatively game-theoretic approach, but some of this richness should be evident. 1 The Independent Private Value (IPV) Model 1.1 A Model The basic auction environment consists of: Bidders i =1,...,n • Oneobjecttobesold • Bidder i observes a “signal” Si F ( ), with typical realization si • [s, s], and assume F is continuous.∼ · ∈ Bidders’ signals S1,...,Sn are independent. • Bidder i’s value vi(si)=si. • Given this basic set-up, specifying a set of auction rules will give rise to a game between the bidders. Before going on, observe two features of the model that turn out to be important. First, bidder i’s information (her signal) is independent of bidder j’s information. Second, bidder i’s value is independent of bidder j’s information – so bidder j’s information is private in the sense that it doesn’t affect anyone else’s valuation. 1 1.2 Vickrey (Second-Price) Auction In a Vickrey, or second price, auction, bidders are asked to submit sealed bids b1,...,bn. The bidder who submits the highest bid is awarded the object, and pays the amount of the second highest bid. -
Should First-Price Auctions Be Transparent?∗
Should First-Price Auctions be Transparent?∗ Dirk Bergemann† Johannes H¨orner‡ April 7, 2017 Abstract We investigate the role of market transparency in repeated first-price auctions. We consider a setting with independent private and persistent values. We analyze three distinct disclosure regimes regarding the bid and award history. In the minimal disclosure regime each bidder only learns privately whether he won or lost the auction. In equilibrium the allocation is efficient and the minimal disclosure regime does not give rise to pooling equilibria. In contrast, in disclosure settings where either all or only the winner’s bids are public, an inefficient pooling equilibrium with low revenues exists. ∗We gratefully acknowledge financial support from NSF SES 0851200 and ICES 1215808. We thank the co- editor, Phil Reny, and two anonymous referees, for helpful comments and suggestions. We are grateful to seminar participants at the NBER Market Design Meeting, University of Mannheim, University of Munich and the University of Pennsylvania for their constructive comments. Lastly, thanks to Yi Chen for excellent research assistance. †Department of Economics, Yale University, New Haven, CT 06511, [email protected] ‡Department of Economics, Yale University, New Haven, CT 06511, [email protected] 1 1 Introduction 1.1 Motivation Information revelation policies vary widely across auction formats. In the U.S. procurement context, as a consequence of the “Freedom of Information Act,” the public sector is generally subject to strict transparency requirements that require full disclosure of the identity of the bidders and the terms of each bid. In auctions of mineral rights to U.S. -
Is the `Linkage Principle' Valid?: Evidence from the Field
Center for Economic Institutions Working Paper Series No. 2010-4 “Is the ’Linkage Principle’ Valid?: Evidence from the Field” Sung-Jin Cho, Harry J. Paarsch and John Rust November 2010 Center for Economic Institutions Working Paper Series Institute of Economic Research Hitotsubashi University 2-1 Naka, Kunitachi, Tokyo, 186-8603 JAPAN http://cei.ier.hit-u.ac.jp/English/index.html Tel:+81-42-580-8405/Fax:+81-42-580-8333 Paper for Discussion: first draft, 19 December 2009; this draft, November 27, 2010. IS THE `LINKAGE PRINCIPLE' VALID?: EVIDENCE FROM THE FIELD BY SUNG-JIN CHO, HARRY J. PAARSCH, AND JOHN RUST Seoul National University, University of Melbourne, and University of Maryland We present field evidence involving experienced bidders that supports the link- age principle—specifically, the prediction that in affiliated-values auction environments the expected revenues generated at open-outcry, ascending-bid (English) auctions are higher than those under other auction formats that reveal less information to partic- ipants. Using field data from a large seller of automobiles which experimented with different selling formats, we find that the seller’s average revenues were significantly higher under an English auction than under a dynamic Internet auction that revealed far less information to bidders. 1. Introduction and Motivation. In an influential and classic paper, Milgrom and Weber [1982] de- rived a powerful result, and coined the term linkage principle to describe it. Simply put, in auction environ- ments having affiliated values, the linkage principle states that a seller can expect to increase revenues by providing more information to bidders, both before and during the auction. -
Design of a Multi-Unit Double Auction E-Market
Design of a Multi-unit Double Auction E-Market Pu Huang Center for Automated Learning and Discovery School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 [email protected] Alan Scheller-Wolf Graduate School of Industrial Administration Carnegie Mellon University Pittsburgh, PA 15213 [email protected] Katia Sycara The Robotics Institute Carnegie Mellon University Pittsburgh, PA 15213 [email protected] ¡ This paper has been accepted for publication in Computational Intelligence. 1 Abstract We envision a future economy where e-markets will play an essential role as exchange hubs for commodities and services. Future e-markets should be designed to be robust to manipu- lation, flexible, and sufficiently efficient in facilitating exchanges. One of the most important aspects of designing an e-market is market mechanism design. A market mechanism defines the organization, information exchange process, trading procedure and clearance rules of a market. If we view an e-market as a multi-agent system, the market mechanism also defines the structure and rules of the environment in which agents (buyers and sellers) play the market game. We design an e-market mechanism that is strategy-proof with respect to reservation price, weakly budget-balanced and individually rational. Our mechanism also makes sellers unlikely to under-report the supply volume to drive up the market price. In addition, by bound- ing our market’s efficiency loss, we provide fairly unrestrictive sufficient conditions for the efficiency of our mechanism to converge in a strong sense when (1) the number of agents who successfully trade is large, or (2) the number of agents, trading and not, is large.