Common-Value Auctions with Liquidity Needs: an Experimental

Total Page:16

File Type:pdf, Size:1020Kb

Common-Value Auctions with Liquidity Needs: an Experimental Common­Value Auctions with Liquidity Needs: An Experimental Test of a Troubled Assets Reverse Auction Lawrence M. Ausubel, Peter Cramton, Emel Filiz‐Ozbay, Nathaniel Higgins, Erkut Ozbay, and Andrew Stocking* 21 May 2009 Abstract We experimentally test alternative auction designs suitable for pricing and removing troubled assets from banks’ balance sheets as part of the financial rescue. Many individual securities or pools of securities are auctioned simultaneously. Securities that are widely held are purchased in auctions for individual securities. Securities with concentrated ownership are purchased as pools of related securities. Each bank has private information about its liquidity need and the true common value of each security. We study bidding behavior and performance of sealed‐ bid uniform‐price auctions and dynamic clock auctions. The clock and sealed‐bid auctions resulted in similar prices. However, the clock auctions resulted in substantially higher bank payoffs, since the dynamic auction enabled the banks to better manage their liquidity needs. The clock auctions also reduced bidder error. The experiments demonstrated the feasibility of quickly implementing simple and effective auction designs to help resolve the crisis. (JEL D44, C92, G01, G21. Keywords: financial crisis, uniform‐price auction, clock auction, market design, experiments, troubled assets, TARP.) 1 Introduction On 3 October 2008, the US Congress passed and the President signed the Emergency Economic Stabilization Act of 2008 (Public Law 110‐343). The Act established the $700 billion Troubled Asset Relief Program (TARP). It authorized the US Treasury to purchase troubled assets in order to restore liquidity to financial markets, favoring. the use of market mechanisms such as reverse auctions for asset purchases. An immediate question is what auction designs are well‐suited to the task. Ausubel and Cramton (2008a,b) discuss the design issues as they appeared in October 2008. This paper tests alternative auction designs in the economics laboratory. The test not only provides insights into bidding behavior and performance of the various designs, but it also demonstrates the feasibility of quickly implementing such auctions as part of a financial rescue. In terms of scope, the banks held roughly 8,000 distinct troubled securities, potentially available for purchase. For the purposes of this paper, these assets fall into two general groups: 1) those securities with ownership concentrated among only a few firms; and 2) those securities with less concentrated ownership. By the nature of these troubled assets, all are believed to be worth less than face value. However, some securities are more “troubled” than others. Some are relatively high‐valued * The authors are economics professors and doctoral candidates at the University of Maryland. Correspondence to: [email protected], [email protected], [email protected], [email protected], [email protected], and [email protected]. We thank Power Auctions LLC and its employees for customizing the auction software and making it available for this purpose. The views expressed are solely the opinions of the authors. securities (e.g., a market value of 75 cents on the dollar) and others are relatively low‐valued securities (e.g., a market value of 25 cents on the dollar). The challenge before the Treasury is to purchase these troubled assets so as to balance two competing criteria: 1) assuring that the taxpayer does not overpay for the assets; and 2) improving banking sector stability by purchasing assets from those banks most in need of liquidity. There is a rich economic literature that points to the advantages of a competitive process over negotiation (see e.g., Bulow and Klemperer 1996) and thus we focus exclusively on auctions for accomplishing Treasury’s objectives. It is within this context that we designed our auction experiment to help us understand the outcomes and relative advantages of alternative auction formats. During the period 12‐24 October 2008 and 6‐11 November 2008, using commercial auction software customized for our purpose, we tested two different auction environments at the University of Maryland’s experimental economics laboratory.1 For each auction environment, we analyzed sealed‐bid uniform‐price auctions and dynamic clock auctions, varying the level of competition, the information, and the banks’ need for liquidity. The experimental auction environments were closely tailored to the likely settings of the planned auctions for troubled assets. Specifically, to model the case where there is sufficient competition to conduct a competitive auction for individual securities, we ran an 8‐security simultaneous reverse auction. Each security has a pure common value with unconditional expectation of 50 cents on the dollar, bidders have private information about the common value, and a fixed quantity of each security is purchased in the same reverse auction. This is a security‐by‐security auction. In the second auction environment, the ownership of the security is too concentrated to allow individual purchase. Securities of a similar quality are pooled together, thus mitigating the concentration of ownership problem, and each security owner competes against others in the pool to sell securities to Treasury. In this second auction environment each security has a pure common value, bidders have asymmetric endowments, and bidders with larger holdings of a security have more private information about the common value. In order to implement an auction where dissimilar items are purchased together, bidders compete on the basis of a reference price, which reflects the government’s best estimate of the security’s value. Bidders then compete on a relative basis—a bid expresses willingness to tender a security at a stated percentage of the security's reference price. This is referred to as a reference price auction. The human subjects bidding in the auctions were experienced PhD students, highly motivated by the prospect of earning roughly $1200 each—the actual amount depending on performance—for participating in twelve experimental sessions, each lasting two to three hours, over the three‐week period. We chose to use experienced PhD students for these experiments, since the environment is considerably more complex than a typical economics experiment, and we believed that the PhD students’ behavior would be more representative of the sophisticated financial firms who would be participating in the actual auctions. Several conclusions emerge from the experiments. The auctions are competitive. Owing to the bidders’ liquidity needs, the Treasury pays less than the true common value of the securities under either format. The sealed‐bid auction is more prone to bidder error. The dynamic clock auction enables bidders to manage their liquidity needs better. The bidders attain higher payoffs (trading profits plus liquidity bonus) in the dynamic clock auctions than in the sealed‐bid auctions. 1 http://www.econ.umd.edu/resources/computing/experimental 2 Nevertheless, the clock auctions result in equivalent aggregate expenditures, so that the benefit to the bidders does not come at the taxpayers’ expense. The prices resulting from the clock auctions are a better indication of true values than those from the sealed‐bid auctions. Thus, the clock auction is apt to reduce risk for both banks and the Treasury, and to generate price information that may help to unfreeze the secondary markets. We conclude that the dynamic clock auction is beneficial for both the banks and the taxpayers. The banks attain higher payoffs than in the sealed‐bid auction, resulting from better liquidity management. The taxpayers are also better off, as the asset purchase program is better directed toward the liquidity needs of the banking sector without increasing the cost of the asset purchase program. The variability of outcomes is also reduced and the informativeness of prices is also increased with the clock format. More broadly, the experiments demonstrated the feasibility for quick implementation. The commercial auction platform was customized to handle both formats in one week. Both formats are easy to explain to bidders. Sophisticated subjects required only a three‐hour training session to understand the setting, the auction rules, and to practice using the software. In November 2008, the Treasury decided to concentrate on negotiated equity purchases and postpone the purchase of troubled assets via auction. In March 2009, the Treasury proposed auctions to purchase pools of legacy loans from banks’ balance sheets, but this time using a forward auction in which private investors compete to buy the pools of loans. Ausubel and Cramton (2009) describe the auction design issues in this new setting and argue for a two‐sided auction in which the private investors compete to buy loan pools in a forward auction, and then banks compete in a reverse auction to determine which trades transact. The results we present here are fully applicable to the new setting. The forward auction is analogous to the security‐by‐security auction, and the reverse auction is analogous to the reference price auction. The remainder of the paper proceeds as follows. In Section 2 we summarize the experimental literature with respect to dynamic and sealed‐bid auctions. Our analysis builds on this literature. Section 3 briefly describes the experimental setup. The instructions and related materials are available in the appendix. Section 4 provides
Recommended publications
  • 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.
    [Show full text]
  • Forward Auction Bidding System User Guide Disclaimer
    FCC Incentive Auction Forward Auction Clock Phase Bidding System USER GUIDE Last updated: July 22, 2016 Forward Auction Bidding System User Guide Disclaimer DISCLAIMER The Federal Communications Commission (the “Commission”) will make available a web-based Auction System for incentive auction bidding purposes. The Commission makes no warranty whatsoever with respect to the Auction System. In no event shall the Commission, or any of its officers, employees or agents, be liable for any damages whatsoever (including, but not limited to, loss of business profits, business interruption, loss of business information, or any other loss) arising out of, or relating to the existence, furnishing, functioning or use of the Auction System that is accessible to bidders in connection with this auction. Moreover, no obligation or liability will arise out of the Commission’s technical, programming or other advice or service provided in connection with the Auction System. The examples that appear in this document are based on fictitious data and do not represent the actual data for this auction. Additionally, they do not reflect any predictions or assumptions about the actual bidding in the auction, the number of rounds, or the outcome of the auction. Any similarity to actual company names, PINs, FCC Registration Numbers (FRNs), or other personal information is coincidental. COPYRIGHT NOTICE Copyright © 2005–2016 by Power Auctions LLC. The software service makes use of proprietary technology protected by US Patent Numbers 7,062,461; 7,165,046; 7,343,342; 7,467,111; 7,870,050; 7,899,734; 7,966,247; 8,447,662; and 8,762,222.
    [Show full text]
  • Using Emptoris 8 Reverse Auction
    Using Emptoris ® 8 Reverse Auction ® and Emptoris ® are registered trademarks of Emptoris, Inc. All other trademarks and registered trademarks are the property of their respective holders. Copyright © 2001-2009 by Emptoris, Inc. All Rights Reserved. Table of Contents Reverse Auction Getting Started ........................................................................................ 1 Reverse Auction Defining Bidding Rules......................................................................... 21 Reverse Auction Defining Items ....................................................................................... 29 Reverse Auction Defining Bid Fields ............................................................................... 53 Reverse Auction Inviting Suppliers .................................................................................. 67 Reverse Auction Defining Bid Transformations .............................................................. 83 Reverse Auction Defining the Auction Team ................................................................... 89 Reverse Auction Scheduling the Event ............................................................................. 97 Reverse Auction – Supplier Side View and Accept the Event ....................................... 109 Reverse Auction – Supplier Side Bidding on an Auction Event ................................... 125 Reverse Auction Monitoring the Event .......................................................................... 157 Reverse Auction Monitoring the Event
    [Show full text]
  • A Primer on Auction Design, Management, and Strategy∗
    A Primer on Auction Design, Management, and Strategy∗ David J. Salant TSE 31000 Toulouse December 23, 2013 DRAFT 2 Contents 1 Introduction 11 1.1 Goals of this Primer . 11 1.2 What are Auctions? . 14 1.2.1 Why Auctions? . 16 1.2.2 Types of Auctions . 17 1.3 A New Age of Auctions . 19 1.3.1 New Types of Auctions . 20 1.3.2 Auctions Replacing Regulation . 22 1.3.3 Auctions in the Private Sector . 24 1.4 Why Auction Design (and Management) Matters . 25 1.5 Outline of This Primer . 27 2 Game Theory, Auction Design, and Strategy 29 2.1 Game Theory and Auctions . 29 2.2 Noncooperative Games . 30 2.2.1 One-Shot Auctions . 30 3 4 CONTENTS 2.2.2 Normal Form Games . 31 2.2.3 Equilibrium in Normal Form Games . 32 2.2.4 Mixed Equilibrium in Spectrum Auctions: Some Ex- amples . 33 2.2.5 Equilibrium in Multi-attribute Auctions . 34 2.3 Multi-stage and Sequential Auctions . 36 2.3.1 Subgame Perfect Equilibrium . 36 2.3.2 Signaling Games . 38 2.4 Repeated Games . 39 2.4.1 Finitely Repeated Games . 40 2.4.2 Infinitely Repeated Games . 41 2.4.3 Overlapping Generations of Players . 42 2.5 Summary . 42 3 Revenue Equivalence 45 3.1 The Four Basic Auction Types for Single-Object Auctions . 45 3.2 Auction Strategy in the Four Basic Auction Types . 47 3.3 Strategic Equivalence . 48 3.4 Revenue Equivalence of English and Dutch Auctions . 51 3.5 Summary .
    [Show full text]
  • Online Reverse Auctions: an Overview
    Journal of International Technology and Information Management Volume 13 Issue 4 Article 5 2004 Online Reverse Auctions: An Overview Ching-Chung Kuo University of North Texas Pamela Rogers University of North Texas Richard E. White University of North Texas Follow this and additional works at: https://scholarworks.lib.csusb.edu/jitim Part of the Business Intelligence Commons, E-Commerce Commons, Management Information Systems Commons, Management Sciences and Quantitative Methods Commons, Operational Research Commons, and the Technology and Innovation Commons Recommended Citation Kuo, Ching-Chung; Rogers, Pamela; and White, Richard E. (2004) "Online Reverse Auctions: An Overview," Journal of International Technology and Information Management: Vol. 13 : Iss. 4 , Article 5. Available at: https://scholarworks.lib.csusb.edu/jitim/vol13/iss4/5 This Article is brought to you for free and open access by CSUSB ScholarWorks. It has been accepted for inclusion in Journal of International Technology and Information Management by an authorized editor of CSUSB ScholarWorks. For more information, please contact [email protected]. Online Reverse Auctions: An Overview Journal of International Technology and Information Management Online Reverse Auctions: An Overview Ching-Chung Kuo Pamela Rogers Richard E. White University of North Texas ABSTRACT Electronic commerce (e-commerce) is the fastest growing area in the U.S. economy with electronic procurement (e-procurement) being a major component, and online reverse auctions (ORAs) have emerged as a key e-procurement tool. Since the mid-1990s, ORAs have been gaining in popularity because of their potentially significant positive impact on the profitability of both the buyers and the sellers. Much has been written about the new purchasing paradigm and numerous stories have been reported recently.
    [Show full text]
  • Designing Centralized Markets with Privately Informed Buyers and Sellers∗
    A Long Way Coming: Designing Centralized Markets with Privately Informed Buyers and Sellers∗ Simon Loertscher† Leslie M. Marx‡ Tom Wilkening§ May 1, 2013 Abstract We discuss the economics literature relevant to the appropriate design of centralized market mechanisms for environments where both buyers and sellers have private informa- tion, as is, for example, the case in the “incentive auction” for radio spectrum license that the FCC has been mandated to run. These two-sided problems are markedly different from their one-sided counterparts where private information pertains to buyers only: a) efficient mechanisms do not generate positive revenue, b) maximal revenue extraction has higher opportunity cost, c) incorporating the sale of assets owned by the mechanism designer may improve outcomes, d) arguments for open designs based on the linkage principle are less compelling, e) the structure of the trading network/matching may be more important than issues of substitutes and complements, and f) the loss of welfare plus revenue from excluding a strong buyer can be greater. Because economists designing two-sided markets will rely in part on intuition gained from one-sided markets, an understanding of these differences can be important. We also consider the practical implications for implementation and avenues for future research. Keywords: FCC, spectrum license auction, incentive auction, mechanism design JEL-Classification: C72, D44, D61 ∗The first and third author thank the Department of Treasury and Finance of Victoria and the Australian Communications and Media Authority for helpful discussions that led to the development of the ideas for this paper. We thank Evan Kwerel, Jonathan Levy, Martha Stancill, and John Williams for their extremely valuable input.
    [Show full text]
  • Reverse Auction Bidding: an Analysis of Case Study for Bid
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Texas A&M Repository REVERSE AUCTION BIDDING: AN ANALYSIS OF CASE STUDY FOR BID TIMING A Thesis by APOORV KUMAR Submitted to the Office of Graduate and Professional Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE Chair of Committee, John M. Nichols Committee Members, Edelmiro F. Escamilla John A. Walewski Head of Department, Joseph P. Horlen August 2014 Major Subject: Construction Management Copyright 2014 Apoorv Kumar ABSTRACT Reverse Auction Bidding is utilized by a significant number of enterprises for supply of materials and in part construction. This thesis investigates aspects of the Reverse Auction system using the web site developed by others to continue the work on understanding aspects of the impact of human personality types on the bidding results for a standard game. A game theory was developed for the Reverse Auction Bidding framework used at TAMU to study the results of the bids collected in a standard game. This theory postulated two sub-games exist inside the main Reverse Auction Bidding game. The main sub-game is between the buyer and the set of bidders. The second sub-game is between the bidders. The theory exists that the buyer seeks minimal costs, which must be acknowledged as prima facie correct for this study. Extent studies at TAMU have indicated that the costs distribution is non-Gaussian, indicating that the buyer’s objective is not achieved for all bidders. The second sub-game is between the bidders, they utilize the non-Gaussian component of the profit distribution to amplify individual returns.
    [Show full text]
  • (28 Ghz) and Auction 102 (24 Ghz) Public Notice – AU Docket No
    March 27, 2018 FCC FACT SHEET* Spectrum Frontiers Auction 101 (28 GHz) and Auction 102 (24 GHz) Public Notice – AU Docket No. 18-85 Background: The FCC has established rules for Upper Microwave Flexible Use Service (UMFUS) licenses in several spectrum bands above 24 GHz to promote the development of fifth-generation wireless, the Internet of Things, and other advanced spectrum-based services for the benefit of the public. This Public Notice would propose application and bidding procedures for the auctions of UMFUS licenses in two of these bands – 28 GHz (27.5–28.35 GHz) and 24 GHz (24.25–24.45 and 24.75–25.25 GHz). The 1.55 gigahertz of spectrum available in these auctions will be licensed on a geographic area basis as established by prior Commission actions, with 28 GHz licenses offered in two 425-megahertz blocks by county and 24 GHz licenses offered in seven 100-megahertz blocks by Partial Economic Area (PEA). What the Public Notice Would Do: • Propose to offer the UMFUS licenses through two separate auctions: o The auction of the 28 GHz band (Auction 101) would employ the Commission’s standard simultaneous multiple-round (SMR) auction format. This format offers every license for bid at the same time and consists of successive bidding rounds in which bidders may place bids on individual licenses. o The auction of the 24 GHz band (Auction 102) would employ a clock auction format, which would allow bidding on generic blocks in each Partial Economic Area in successive clock bidding rounds. Also propose procedures for the assignment phase that would allow bidding for frequency-specific license assignments, while ensuring contiguous block assignments.
    [Show full text]
  • PUBLIC NOTICE Federal Communications Commission News Media Information 202 / 418-0500 Th Internet: 445 12 St., S.W
    PUBLIC NOTICE Federal Communications Commission News Media Information 202 / 418-0500 th Internet: http://www.fcc.gov 445 12 St., S.W. TTY: 1-888-835-5322 Washington, D.C. 20554 DA 15-1183 APPLICATION PROCEDURES FOR BROADCAST INCENTIVE AUCTION SCHEDULED TO BEGIN ON MARCH 29, 2016 TECHNICAL FORMULAS FOR COMPETITIVE BIDDING AU Docket No. 14-252 GN Docket No. 12-268 WT Docket No. 12-269 Released: October 15, 2015 TABLE OF CONTENTS Heading Paragraph # I. GENERAL INFORMATION ................................................................................................................ 1 A. Introduction...................................................................................................................................... 1 B. Background of Proceeding............................................................................................................... 3 II. APPLYING TO PARTICIPATE IN THE REVERSE AUCTION........................................................ 5 A. Applicable Rules and Disclaimers ................................................................................................... 6 1. Relevant Authority .................................................................................................................... 6 2. Due Diligence............................................................................................................................ 9 3. Red Light Rule ........................................................................................................................ 11 4. Use
    [Show full text]
  • Computer Science Optimization of Reverse Auctions
    Bachelor Thesis Project Computer Science Optimization Of Reverse Auctions Author: Athmar Mubark Supervisor: Anders Haggren Semester: VT/HT 2017 Subject: Computer Science Abstract Many people still confuse and misunderstand the differences between auction types. In fact, we have only two major types of auctions which are forward auction and reverse auction [22]. In a forward auction a single seller offers an item to sale with many competitive buyers driving the price upward. In a Reverse Auction, a single buyer wants to purchase a service or an item from many sellers, they drive the price downward. There are many differences between these types of auctions. Including the progress of the auctions, winner selection criterion and other factors. The Reverse Auction nowadays is one of the most preferred types of online auctions. It gains popularity rapidly because of representing the buyers’ side and helps him to drive prices down in contrary with forward auction or traditional auction. The aim of this study is to identify the most common types of the reverse auctions and compare them to one another to determine when they should be used by a buyer and propose the most efficient implementation model for some types. The results of this study are: achieve a written report and a small demonstrator model on how to implement English auction and second-sealed bid auction. Keywords: reverse auction, electronic auction, e-auction, e-procurement, online auction, buyer, seller, purchaser, bidding, Reverse English Auction, Reverse Yankee Auction, Reverse Dutch Auction, Reverse Japanese Auction, Reverse Sealed bid Auction, Reverse Vickrey Auction. 2 Preface To my Father & my Mother Who taught me to never give up.
    [Show full text]
  • Developing Agricultural Commodity Markets Through a Better Trading Platform
    Developing Agricultural Commodity Markets Through a Better Trading Platform 13th Annual Farmer Cooperatives Conference Cooperatives: Looking Forward December 6-7, 2010 Brad Miller, Vice President Practice Leader of Auctions & Competitive Bidding A Better Market Mechanism for Agricultural Commodities Overview Market design Implementation – a case study Results The future 1 Copyright © CRA International. All Rights Reserved. Market Design Challenges • Challenges for all market participants – Negotiations are time-consuming and costly – Parties wonder if they got the best deal – Limited ability to manage risk and uncertainty – Information and transaction costs are too high • Challenges for coops and its members – Need price transparency and reliable price signals – Need credible information about current and future market conditions – Need to manage price and quantity volatility – Coops must continually demonstrate value to members 2 Copyright © CRA International. All Rights Reserved. Market Design Advantages of well-designed, structured bidding mechanisms • Can be designed to best meet the needs of both buyers and sellers • Ability to achieve various goals • Fair, open, transparent, objective, non-discriminatory, quick process • Minimizes information and transaction costs • Effective price discovery mechanism and quantity allocation • Maximizes participants’ interest and participation • Those who value the product the most will win, optimizing prices and revenue • Win-win for both buyers and sellers – No regrets, no complaints – Can use resources better, administer contracts more efficiently, make better planning decisions – Value pie is made larger 3 Copyright © CRA International. All Rights Reserved. Market Design How do you design the market mechanism? • Confirm the objectives • Define the products, draft the contracts – Substitutes vs. complements – Common value vs. private value • Identify the participants – Few vs.
    [Show full text]
  • Auctions, Bidding and Exchange Design
    Auctions, Bidding and Exchange Design The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Kalagnanam, Jayant, and David C. Parkes. 2004. Auctions, bidding and exchange design. In Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era, ed. D. Simchi-Levi, S. D. Wu, Z. Shen, 143-212. Boston: Kluwer. Citable link http://nrs.harvard.edu/urn-3:HUL.InstRepos:4045845 Terms of Use This article was downloaded from Harvard University’s DASH repository, and is made available under the terms and conditions applicable to Other Posted Material, as set forth at http:// nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of- use#LAA ¢¡¤£¦¥¨§ © "!#!$ % &'! (*)+,'&%$( !#(-.%# /103210541687905:;05<14=054=05> ?A@"BDC EGFGEIHKJILNMPOQSRTQSFUQWVKX Y Z\[]ZU^_Ha`bFNVaXcC EGFGEIHaJILUMedfEGX3`;EGJUg h Zji"Z @kVmlonqparsg tuVKJUvm`jVawxX_y¦EGQ zsM]`bFIg {|t}p~aar WAUTU ;5NI m 0fj=¦0K ¡ OQ\RQSFUQWVKX¤VI¢£¤XzaQSX¥EEGJNQSXzcHaXu¦¨§"©a©ª QWEI¦c«¥LTQWEGXuLUEGFIg y¬HKJGRmHKJI¦9­®X3QSRsENJGFUQS`b¯g d Ha°²±GJNQW¦TzqE¬B_§¢~Kn]pK³r NµS¶¸·;u··I ¹GNµ»ºGNµ½¼a ·¼K ´ Abstract The different auction types are outlined using a classification framework along six dimensions. The economic properties that are desired in the design of auc- tion mechanisms and the complexities that arise in their implementation are dis- cussed. Some of the most interesting designs from the literature are analyzed in detail to establish known results and to identify the emerging research directions. ¾À¿ Á ÂoÃxÄxÅ_ƤÇȤÃxÉTÅP Auctions have found widespread use in the last few years as a technique for supporting and automating negotiations on the Internet.
    [Show full text]