DOCSLIB.ORG

Introduction to Auctions Protocols Revenue and Optimal Auctions Common Value Auctions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Introduction to Auctions Protocols Revenue and Optimal Auctions Common Value Auctions Auctions Kate Larson Introduction Auction Protocols Common Auction Introduction to Auctions Protocols Revenue and Optimal Auctions Common Value Auctions Vulnerabilities Kate Larson in Auctions Beyond Single Cheriton School of Computer Science Item Auctions University of Waterloo Summary Outline Auctions Kate Larson 1 Introduction Introduction Auction Protocols 2 Auction Protocols Common Auction Protocols Common Auction Protocols Revenue and Optimal Auctions Common Value Revenue and Optimal Auctions Auctions Common Value Auctions Vulnerabilities in Auctions Beyond Single 3 Vulnerabilities in Auctions Item Auctions Summary 4 Beyond Single Item Auctions 5 Summary Auctions Auctions Kate Larson Methods for allocating goods, tasks, resources,... Introduction Participants Auction auctioneer Protocols Common Auction bidders Protocols Revenue and Optimal Auctions Enforced agreement between auctioneer and the Common Value Auctions winning bidder(s) Vulnerabilities in Auctions Easily implementable (e.g. over the Internet) Beyond Single Conventions Item Auctions Summary Auction: one seller and multiple buyers Reverse auction: one buyer and multiple sellers Todays lecture will discuss the theory in the context of auctions, but this applies to reverce auctions as well (at least in 1-item settings). Auction Settings Auctions Kate Larson Introduction Private value: the value of the good depends only on Auction the agent’s own preferences Protocols e.g a cake that is not resold of showed off Common Auction Protocols Revenue and Common value: an agent’s value of an item is Optimal Auctions Common Value determined entirely by others’ values (valuation of the Auctions item is identical for all agents) Vulnerabilities in Auctions e.g. treasury bills Beyond Single Item Auctions Correlated value (interdependent value): agent’s Summary value for an item dpends partly on its own preferences and partly on others’ value for it e.g. auctioning a transportation task when bidders can handle it or reauction it to others Outline Auctions Kate Larson 1 Introduction Introduction Auction Protocols 2 Auction Protocols Common Auction Protocols Common Auction Protocols Revenue and Optimal Auctions Common Value Revenue and Optimal Auctions Auctions Common Value Auctions Vulnerabilities in Auctions Beyond Single 3 Vulnerabilities in Auctions Item Auctions Summary 4 Beyond Single Item Auctions 5 Summary Four Common Auctions Auctions Kate Larson Introduction Auction Protocols Common Auction Protocols English auction Revenue and Optimal Auctions Common Value First-price, sealed-bid auction Auctions Vulnerabilities Dutch auction in Auctions Beyond Single Vickrey auction Item Auctions Summary English auction aka first-price open-cry auction Auctions Kate Larson Introduction Protocol: Each bidder is free to raise their bid. When Auction no bidder is willing to raise, the auction ends and the Protocols Common Auction highest bidder wins. Highest bidder pays its last bid. Protocols Revenue and Optimal Auctions Strategy: Series of bids as a function of agent’s private Common Value Auctions value, prior estimates of others’ valuations, and past Vulnerabilities bids in Auctions Beyond Single Best strategy: Item Auctions Variations: Summary Auctioneer controls the rate of increase Open-exit: Bidders have to openly declare exit with no re-entering possibilities First-price sealed-bid auction Auctions Kate Larson Introduction Auction Protocols Common Auction Protocol: Each bidder submits one bid without Protocols Revenue and knowing others’ bids. The highest bidder wins the item Optimal Auctions Common Value at the price of it’s bid Auctions Vulnerabilities Strategy: Bid as a function of agent’s private value and in Auctions its prior estimates of others’ valuations Beyond Single Item Auctions Best strategy: Summary Example Auctions Kate Larson Assume there are 2 agents (1 and 2) with values v1; v2 Introduction drawn uniformly from [0; 1]. Utility of agent i if it bids bi and Auction Protocols wins is ui = vi − bi . Common Auction Protocols How should 1 bid? (i.e. what is b(v ) = z?). Revenue and 1 Optimal Auctions Common Value Auctions Z 2z 2 Vulnerabilities U1 = (v1 − z)dz = (v1 − z)2z = 2zv1 − 2z in Auctions z=0 Beyond Single Item Auctions Note: given z = b2(v2) = v2=2, 1 only wins if v2 < 2z Summary Therefore, 2 arg max[2zv1 − 2z ] = v1=2 z Similar arguement for agent 2, assuming b1(v1) = v1=2. Example Auctions Kate Larson Introduction Auction Protocols Common Auction Assume that there are 2 risk-neutral bidders, 1 and 2. Protocols Revenue and Optimal Auctions Agent 1 knows that 2’s value is 0 or 100 with equal Common Value Auctions probability Vulnerabilities in Auctions 1’s value of 400 is common knowledge Beyond Single Item Auctions What is a Nash equilibrium? Summary Dutch auction Descending auction Auctions Kate Larson Introduction Auction Protocols Common Auction Protocols Protocol: Auctioneer continuously lowers the price Revenue and Optimal Auctions until a bidder takes the item at the current price Common Value Auctions Strategy: Bid as a function of agent’s private value and Vulnerabilities in Auctions prior estimates of others’ valuations Beyond Single Item Auctions Best strategy: Summary Dutch (Aalsmeer) flower auction Auctions Kate Larson Introduction Auction Protocols Common Auction Protocols Revenue and Optimal Auctions Common Value Auctions Vulnerabilities in Auctions Beyond Single Item Auctions Summary Dutch (Aalsmeer) flower auction Auctions Kate Larson Introduction Auction Protocols Common Auction Protocols Revenue and Optimal Auctions Common Value Auctions Vulnerabilities in Auctions Beyond Single Item Auctions Summary Vickrey Auction aka Second price, sealed bid auction Auctions Kate Larson Introduction Auction Protocol: Each bidder submits one bid without Protocols Common Auction knowing the others’ bids. The highest bidder wins and Protocols Revenue and pays an amount equal to the second highest bid. Optimal Auctions Common Value Auctions Strategy: Bid as a function of agent’s private value and Vulnerabilities its prior estimates of others’ valuations. in Auctions Beyond Single Best strategy: Item Auctions Widely advocated for computational multiagent systems Summary Old (Vickrey 1961) but not widely used by humans Results for Private Value Auctions Auctions Kate Larson Introduction Auction Protocols Dutch and first-price sealed-bid auctions are Common Auction Protocols strategically equivalent Revenue and Optimal Auctions Common Value For risk neutral agents, Vickrey and English auctions Auctions are strategically equivalent Vulnerabilities in Auctions Dominant strategies Beyond Single Item Auctions All four auctions allocate item efficiently Summary Assuming no reservation price for the auctioneer Outline Auctions Kate Larson 1 Introduction Introduction Auction Protocols 2 Auction Protocols Common Auction Protocols Common Auction Protocols Revenue and Optimal Auctions Common Value Revenue and Optimal Auctions Auctions Common Value Auctions Vulnerabilities in Auctions Beyond Single 3 Vulnerabilities in Auctions Item Auctions Summary 4 Beyond Single Item Auctions 5 Summary Revenue Auctions Theorem (Revenue Equivalence) Kate Larson Suppose that Introduction Auction values are independently and identically distributed and Protocols Common Auction all bidders are risk neutral. Protocols Revenue and Optimal Auctions Then any symmetric and increasing equilibrium of any Common Value Auctions standard auction, such that the expected payment of a Vulnerabilities bidder with value zero is zero, yields the same expected in Auctions revenue. Beyond Single Item Auctions Summary Revenue equivalence fails to hold if agents are not risk neutral. Risk averse bidders: Dutch, first-price ≥ Vickrey, English Risk seeking bidders: Dutch, first-price ≤ Vickrey, English Optimal Auctions Auctions Kate Larson Introduction Auction Protocols Common Auction Protocols Revenue and Optimal Auctions Common Value Auctions Vulnerabilities in Auctions Beyond Single Item Auctions Summary Outline Auctions Kate Larson 1 Introduction Introduction Auction Protocols 2 Auction Protocols Common Auction Protocols Common Auction Protocols Revenue and Optimal Auctions Common Value Revenue and Optimal Auctions Auctions Common Value Auctions Vulnerabilities in Auctions Beyond Single 3 Vulnerabilities in Auctions Item Auctions Summary 4 Beyond Single Item Auctions 5 Summary Common Value Auctions Auctions Kate Larson Introduction In a common value auction, the item has some unknown Auction value and each agent has some partial information about Protocols Common Auction the value. Each agent i has signal Xi 2 [0;!i ]. The value V Protocols Revenue and of the item is Optimal Auctions Common Value Auctions V = v(X1;:::; Xn) Vulnerabilities in Auctions Examples Beyond Single Item Auctions Art auctions and resale Summary Construction companies effected by common events (e.g. weather) Oil drilling Common Value Auctions Auctions Kate Larson Introduction Auction Protocols Common Auction Protocols Revenue and At time of bidding the common value is unknown Optimal Auctions Common Value Auctions Bidders may have imperfect estimates about the value Vulnerabilities True value only observed after the auction has taken in Auctions place Beyond Single Item Auctions Summary Winner’s Curse Auctions Kate Larson Introduction Auction Protocols No agent knows for sure the true value of the item Common Auction Protocols The winner is the agent who made the highest guess Revenue and Optimal Auctions Common Value If bidders
Load more

Recommended publications
  • MICROECONOMICS and POLICY ANALYSIS - U8213 Professor Rajeev H
    MICROECONOMICS AND POLICY ANALYSIS - U8213 Professor Rajeev H. Dehejia Class Notes - Spring 2001 Auctions Wednesday, February 14 Reading: Handout, Thaler, Milgram There are two basic forms of auctions: Sealed bid submissions and open bids. In a sealed bid auction individuals do not know what others are bidding. Two types of Sealed Bid Auctions: 1st Price sealed bid auction: The highest bid submitted will be the winning bid. The winner pays what he/she bid. 2nd Price sealed bid auction: Everyone submits sealed bids and the winner is the one who submits the highest bid BUT the price paid by the winner is the 2nd highest bid submitted. Two types of open auctions: English auction: The bidding starts low and incrementally rises until someone is the highest bidder and no one is willing to outbid the highest bidder. Dutch auction: The price starts very high and is keeps going down until someone bids. The first person to bid wins. Why Study Auctions? 1) Auctions can be an efficient method of valuing goods. For example: rights to air waves, signals and bandwidth. The government auctioned off parts of the spectrum in anticipation of new technology. The auctions were appealing because well- structured auctions get people to reveal the true valuation of the good. The company (private entity) actually ends up paying to the government what the good is worth to them. It turned out with these auctions that the willingness to pay for a slice of the spectrum, as revealed by the auction outcome, was much higher than expected. 2) Procurement: Governments and entities want to procure goods and services at the lowest possible price (like an auction in reverse).
    [Show full text]
  • Shill Bidding in English Auctions
    Shill Bidding in English Auctions Wenli Wang Zoltan´ Hidvegi´ Andrew B. Whinston Decision and Information Analysis, Goizueta Business School, Emory University, Atlanta, GA, 30322 Center for Research on Electronic Commerce, Department of MSIS, The University of Texas at Austin, Austin, TX 78712 ¡ wenli [email protected] ¡ [email protected] [email protected] First version: January, 2001 Current revision: September 6, 2001 Shill bidding in English auction is the deliberate placing bids on the seller’s behalf to artificially drive up the price of his auctioned item. Shill bidding has been known to occur in auctions of high-value items like art and antiques where bidders’ valuations differ and the seller’s payoff from fraud is high. We prove that private- value English auctions with shill bidding can result in a higher expected seller profit than first and second price sealed-bid auctions. To deter shill bidding, we introduce a mechanism which makes shill bidding unprofitable. The mechanism emphasizes the role of an auctioneer who charges the seller a commission fee based on the difference between the winning bid and the seller’s reserve. Commission rates vary from market to market and are mathematically determined to guarantee the non-profitability of shill bidding. We demonstrate through examples how this mechanism works and analyze the seller’s optimal strategy. The Internet provides auctions accessible to the general pub- erature on auction theories, which currently are insufficient to lic. Anyone can easily participate in online auctions, either as guide online practices. a seller or a buyer, and the value of items sold ranges from a One of the emerging issues is shill bidding, which has become few dollars to millions.
    [Show full text]
  • Game Theory 2021
    More Mechanism Design Game Theory 2021 Game Theory 2021 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 More Mechanism Design Game Theory 2021 Plan for Today In this second lecture on mechanism design we are going to generalise beyond the basic scenario of auctions|as much as we can manage: • Revelation Principle: can focus on direct-revelation mechanisms • formal model of direct-revelation mechanisms with money • incentive compatibility of the Vickrey-Clarke-Groves mechanism • other properties of VCG for special case of combinatorial auctions • impossibility of achieving incentive compatibility more generally Much of this is also (somewhat differently) covered by Nisan (2007). N. Nisan. Introduction to Mechanism Design (for Computer Scientists). In N. Nisan et al. (eds.), Algorithmic Game Theory. Cambridge University Press, 2007. Ulle Endriss 2 More Mechanism Design Game Theory 2021 Reminder Last time we saw four auction mechanisms for selling a single item: English, Dutch, first-price sealed-bid, Vickrey. The Vickrey auction was particularly interesting: • each bidder submits a bid in a sealed envelope • the bidder with the highest bid wins, but pays the price of the second highest bid (unless it's below the reservation price) It is a direct-revelation mechanism (unlike English and Dutch auctions) and it is incentive-compatible, i.e., truth-telling is a dominant strategy (unlike for Dutch and FPSB auctions). Ulle Endriss 3 More Mechanism Design Game Theory 2021 The Revelation Principle Revelation Principle: Any outcome that is implementable in dominant strategies via some mechanism can also be implemented by means of a direct-revelation mechanism making truth-telling a dominant strategy.
    [Show full text]
  • Reverse Live Auction for Bidder
    Process for Reverse Live Auction What is Reverse Live Auction? Reverse Live Auction (RLA) implemented in the Chhattisgarh State Power Companies uses Supplier Relationship Management (SRM) module of SAP (globally Known ERP). RLA provides a real-time environment which drives bottom-line results significantly by putting suppliers into direct competition with each other. Transaction type “English Auction” is used in RLA which works on principal “New Bid Must Beat Overall Best Bid”. RLA have the provision of setting up the auction with automatic extensions that is if the bid is submitted within few minutes/seconds of the auction end time. The auction end time will automatically get extended, based on the timing parameters fixed by purchaser. Automatic Extension of end time in RLA is based on below given 3 parameters defined by Purchaser and also visible to bidders once the RLA is published: • Remaining Time Trigger: This field refers to the duration of time (minutes), before which Reverse Live Auction is programmed to end, if a new bid is placed within this time duration, the RLA will be extended with specified time (Extension Period). • Extension Period: The span of time (hours or minutes) by which the system extends an RLA, if a bid is received during “Remaining Time Trigger” period. • Number of Extensions: This field depicts the maximum number of times by which an auction can be extended automatically. Process for Reverse Live Auction Please follow the below given steps to configure Java to run the “Live Auction Cockpit” in case the Application is blocked by JAVA: 1. Go to Control Panel > Double click on JAVA to open.
    [Show full text]
  • WRAP THESIS Nour 2012.Pdf
    University of Warwick institutional repository: http://go.warwick.ac.uk/wrap A Thesis Submitted for the Degree of PhD at the University of Warwick http://go.warwick.ac.uk/wrap/56244 This thesis is made available online and is protected by original copyright. Please scroll down to view the document itself. Please refer to the repository record for this item for information to help you to cite it. Our policy information is available from the repository home page. The Investment Promotion and Environment Protection Balance in Ethiopia’s Floriculture: The Legal Regime and Global Value Chain By Elias Nour (Elias N. Stebek) A Thesis Submitted in Partial Fulfilment of the Requirements for the Degree of Doctor of Philosophy (PhD) in Law University of Warwick School of Law June 2012 (Final Version: 9 December 2012) CONTENTS Page Contents ............................................................................................................................................... ii Table of Legislation ......................................................................................................................... viii Table of Figures and Tables .............................................................................................................. ix Acknowledgments .............................................................................................................................. x Declaration .........................................................................................................................................
    [Show full text]
  • Auctioning One Item
    Auctioning one item Tuomas Sandholm Computer Science Department Carnegie Mellon University Auctions • Methods for allocating goods, tasks, resources... • Participants: auctioneer, bidders • Enforced agreement between auctioneer & winning bidder(s) • Easily implementable e.g. over the Internet – Many existing Internet auction sites • Auction (selling item(s)): One seller, multiple buyers – E.g. selling a bull on eBay • Reverse auction (buying item(s)): One buyer, multiple sellers – E.g. procurement • We will discuss the theory in the context of auctions, but same theory applies to reverse auctions – at least in 1-item settings Auction settings • Private value : value of the good depends only on the agent’s own preferences – E.g. cake which is not resold or showed off • Common value : agent’s value of an item determined entirely by others’ values – E.g. treasury bills • Correlated value : agent’s value of an item depends partly on its own preferences & partly on others’ values for it – E.g. auctioning a transportation task when bidders can handle it or reauction it to others Auction protocols: All-pay • Protocol: Each bidder is free to raise his bid. When no bidder is willing to raise, the auction ends, and the highest bidder wins the item. All bidders have to pay their last bid • Strategy: Series of bids as a function of agent’s private value, his prior estimates of others’ valuations, and past bids • Best strategy: ? • In private value settings it can be computed (low bids) • Potentially long bidding process • Variations – Each agent pays only part of his highest bid – Each agent’s payment is a function of the highest bid of all agents • E.g.
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • English and Vickrey Auctions
    CHAPTER ONE English and Vickrey Auctions I describe a bit of the history of auctions, the two pairs of standard auction forms, and the ideas of dominance and strategic equivalence. 1.1 Auctions It is hard to imagine modern civilization without buying and selling, which make possible the division of labor and its consequent wealth (Smith, 1776). For many common and relatively inexpensive commodi­ ties, the usual and convenient practice at the retail level, in the West anyway, is simply for the seller to post a take-it-or-leave-it price, and for the prospective buyer to choose what to buy and where to buy it, perhaps shopping for favorable prices. I haven’t tried haggling over price at a Wal-Mart, but I can’t imagine it would get me very far. For some big-ticket items, however, like houses and cars, haggling and counteroffers are expected, even in polite society, and bargaining can be extended over many rounds. In some cultures, haggling is the rule for almost all purchases. A third possibility, our subject here, is the auction, where many prospective buyers compete for the opportunity to purchase items, either simultaneously, or over an extended period of time. The main attraction of the auction is that it can be used to sell things with more or less uncertain market value, like a tractor in a farmer’s estate, a manufacturer’s overrun of shampoo, or the final working copy of Beethoven’s score for his Ninth Symphony (see fig. 1.1). It thus promises to fetch as high a price as possible for the seller, while at the same time offering to the buyer the prospect of buying items at bargain prices, or perhaps buying items that would be difficult to buy in any other way.
    [Show full text]
  • Thesis and the Origins of Dutch Horticulture 85 Tulips Yesterday and Today 89
    UvA-DARE (Digital Academic Repository) The making of Dutch flower culture: Auctions, networks, and aesthetics Gebhardt, A.C. Publication date 2014 Document Version Final published version Link to publication Citation for published version (APA): Gebhardt, A. C. (2014). The making of Dutch flower culture: Auctions, networks, and aesthetics. General rights It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons). Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva.nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible. UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl) Download date:02 Oct 2021 The Flower of Making Dutch Culture The Making of Dutch Flower Culture Auctions, Networks, and Aesthetics Andrew Gebhardt Andrew Gebhardt The Making of Dutch Flower Culture Auctions, Networks, and Aesthetics ACADEMISCH PROEFSCHRIFT ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam Op gezag van de Rector Magnificus prof. dr. D.C. van den Boom ten overstaan van een door het college voor promoties ingestelde commissie, in het openbaar te verdedigen in de Agnietenkapel op donderdag 6 februari 2014, te 12:00 uur Door Andrew Christian Gebhardt geboren te Washington, D.C., Verenigde Staten Promotiecommissie Promotor: Prof.
    [Show full text]
  • Bidding Strategy and Auction Design
    16 ■ Bidding Strategy and Auction Design UCTIONS AS MECHANISMS for selling goods and services date back to ancient Greece and Rome, where slaves and wives were commonly bought and sold at well-known public auction sites. Although the auction waned as a sales mechanism for several centuries after the fall of the Roman Em- pire,A it regained popularity in eighteenth-century Britain and has been a com- mon, if not ubiquitous, method of commerce since that time. Many thousands of people now make purchases at online auctions every day, and some may buy other items by way of mechanisms that are not even recognized as auctions. Despite this long history, the first formal analysis of auctions dates only to 1961 and the path-breaking work of Nobel Prize winner William Vickrey. In the decades that followed, economists have devoted considerable energy to devel- oping a better understanding of sales by auction, from the standpoint of both buyers (bidding strategy) and sellers (auction design). We cover both topics and provide a primer on auction rules and environments in this chapter. Technically, the term “auction” refers to any transaction where the final price of the object for sale is arrived at by way of competitive bidding. Many dif- ferent types of transactions fit this description. For example, the historic Filene’s Basement department store in Boston used a clever pricing strategy to keep cus- tomers coming back for more: it reduced the prices on items remaining on the racks successively each week until either the goods were purchased or the price got so low that it donated the items to charity.
    [Show full text]
  • CS 497: Electronic Market Design
    CS 497: Electronic Market Design Kate Larson David R. Cheriton School of Computer Science University of Waterloo Kate Larson CS 497 Outline Kate Larson CS 497 Auctions Methods for allocating goods, tasks, resources,... Participants auctioneer bidders Enforced agreement between auctioneer and the winning bidder(s) Easily implementable (e.g. over the Internet) Conventions Auction: one seller and multiple buyers Reverse auction: one buyer and multiple sellers Kate Larson CS 497 Auction Settings Private value: the value of the good depends only on the agent’s own preferences e.g a cake that is not resold of showed off Common value: an agent’s value of an item is determined entirely by others’ values (valuation of the item is identical for all agents) e.g. treasury bills Correlated value (interdependent value): agent’s value for an item depends partly on its own preferences and partly on others’ value for it e.g. auctioning a transportation task when bidders can handle it or reauction it to others Kate Larson CS 497 Auction Settings Private value: the value of the good depends only on the agent’s own preferences e.g a cake that is not resold of showed off Common value: an agent’s value of an item is determined entirely by others’ values (valuation of the item is identical for all agents) e.g. treasury bills Correlated value (interdependent value): agent’s value for an item depends partly on its own preferences and partly on others’ value for it e.g. auctioning a transportation task when bidders can handle it or reauction it to others Kate Larson CS 497 Auction Settings Private value: the value of the good depends only on the agent’s own preferences e.g a cake that is not resold of showed off Common value: an agent’s value of an item is determined entirely by others’ values (valuation of the item is identical for all agents) e.g.
    [Show full text]