Bidding with Securities: Auctions and Security Design

Total Page:16

File Type:pdf, Size:1020Kb

Bidding with Securities: Auctions and Security Design Bidding with Securities: Auctions and Security Design By PETER M. DEMARZO,ILAN KREMER, AND ANDRZEJ SKRZYPACZ* We study security-bid auctions in which bidders compete for an asset by bidding with securities whose payments are contingent on the asset’s realized value. In formal security-bid auctions, the seller restricts the security design to an ordered set and uses a standard auction format (e.g., first- or second-price). In informal settings, bidders offer arbitrary securities and the seller chooses the most attractive bid, based on his beliefs, ex post. We characterize equilibrium and show that steeper securities yield higher revenues, that auction formats can be ranked based on the security design, and that informal auctions lead to the lowest possible revenues. (JEL D44, G32, G34) Auction theory and its applications have be- bid auction, and provide an extensive charac- come increasingly important as an area of eco- terization of such auctions. nomic research over the last 20 years. As a Formal auctions of this type are commonly result, we now have a better understanding of used in government sales of oil leases, wireless how the structure of an auction affects its out- spectrum, highway building contracts, and lead- come. Almost all the existing literature studies plaintiff auctions. Informal auctions of this type the case when bidders use cash payments, so (in the sense that formal auction rules are not set that the value of a bid is not contingent on future forth in advance) are common in the private events. sector. Examples include authors selling pub- In a few cases, such as art auctions, the real- lishing rights, entrepreneurs selling their firm to ized value is subjective and cannot be used as a an acquirer or soliciting venture capital, and basis for payment; however, this is the excep- sports associations selling broadcasting rights.1 tion. In many important applications, the real- The major difference between a formal and ization of the future cash flow generated by the an informal mechanism is the level of commit- auctioned asset or project can be used in deter- ment by the seller. In an informal mechanism, mining the actual payment. That is, the bids can bidders choose which securities to offer, and the be securities whose values are derived from the seller selects the most attractive offer ex post. In future cash flow. We call this setting a security- this case, the auction contains the elements of a signaling game because the seller may infer bidders’ private information from their security choices when evaluating their offers. In a for- * Stanford Graduate School of Business, 518 Memorial mal mechanism the seller restricts bidders to use Way, Stanford, CA 94305 (e-mails: DeMarzo: pdemarzo@ stanford.edu; Kremer: [email protected]; Skrzypacz: [email protected]). We thank two anonymous refer- 1 See Kenneth Hendricks and Robert H. Porter (1988) for ees, Kerry Back, Simon Board, Sandro Brusco, Nicolae a discussion of oil lease auctions, in which royalty rates are Garleanu, Burton Hollifield, John Morgan, and seminar commonly used. In wireless spectrum auctions, the bids are participants at Harvard University, Hebrew University, Uni- effectively debt securities (leading in some cases to default). versity of Iowa, Massachusetts Institute of Technology, Highway building contracts are often awarded through New York University, Stanford University, University of “build, operate, and transfer” agreements to the bidder that New York at Stony Brook, Technion, Tel Aviv University, offers to charge the lowest toll for a pre-specified period. UC Berkeley, UC Davis, UC San Diego, USC, Washington See Jill E. Fisch (2001) for the use of contingency-fee University, Yale University, WFA 2003, ASSA 2004, the auctions in the selection of the lead plaintiff in class action Stony Brook International Conference on Game Theory suits. In mergers, acquisitions, and venture capital agree- 2004, and the Utah Winter Finance Conference 2004 for ments, equity and other securities are commonly used (see useful comments. This material is based upon work sup- Kenneth J. Martin, 1996). John McMillan (1991) describes ported by the National Science Foundation under Grant the auction of the broadcast rights to the Olympic games, 0318476. We also acknowledge the financial support of the where bids contained revenue-sharing clauses. Similarly, Center for Electronic Business and Commerce. publishing contracts include advance and royalty payments. 936 VOL. 95 NO. 4 DEMARZO ET AL.: AUCTIONS AND SECURITY DESIGN 937 securities from a pre-specified ordered set, such reservation values. As a result, Alice as an equity share or royalty rate. The seller is would bid 4 Ϫ 1 ϭ $3M and win the committed to disqualify any offer outside this auction, paying Bob’s bid of 3 Ϫ 1 ϭ set. The seller also commits to an auction for- $2M. mat, such as a first- or second-price auction. One of our main results is that the revenues Now suppose that rather than bidding from an informal mechanism are the lowest with cash, the bidders compete by offer- ing a fraction of the future revenues. As across a large set of possible mechanisms. In we discuss later, it is again a dominant other words, the seller benefits from any form of strategy for bidders to bid their reserva- commitment. Moreover, we show how to rank tion values. Alice offers 3⁄4 of future cash security designs and auction formats in terms of flows while Bob offers 2⁄3. As a result, their impact on the seller’s revenues, and that Alice wins the auction and pays according the design of the securities can be more impor- to Bob’s bid; that is, she gives up 2⁄3 of the tant than design of the auction itself. future revenues. This yields a higher pay- off for the auctioneer; (2⁄3) ϫ $4M ϭ In our model, several agents compete for an Ͼ asset or project that requires an upfront invest- $2.67M $2M (in addition to any up- front payment). ment. This investment may correspond to an amount of cash that the seller needs to raise, or the resources required to run the project. Bid- This example is based on Robert G. Hansen ders observe private signals regarding the value (1985), who was the first to examine the use of they can expect if they acquire the asset. Our securities in an auction setting. Hansen showed initial structure is similar to an independent that a second-price equity auction yields higher private values model, so that different bidders expected revenues than a cash-based auction. In expect different payoffs upon winning, although a related paper, John G. Riley (1988) considers we also consider correlated and common val- first-price auctions where bids include royalty ues. The model differs from standard auction payments in addition to cash. He shows that models in that bids are securities. Bidders offer adding the royalty increases expected revenues. derivatives in which the underlying value is the The intuition in both cases is that adding an future payoff of the asset. Because the winner equity component to the bid lowers the differ- may make investments or take other actions that ence between the winner’s valuation and that of affect this payoff, we also discuss the possibility the second highest bidder. Because this differ- of moral hazard. ence is the rent captured by the winner, reduc- One might conjecture that the results from ing it benefits the seller. standard auction theory carry over to security- In this paper, we generalize this insight along bid auctions by simply replacing each security several dimensions. First, we consider a general with its cash value. Unlike cash bids, however, class of securities that includes debt, equity or the value of a security bid depends upon the royalty rates, options, and hybrids of these. Sec- bidder’s private information. This difference ond, we consider alternative auction formats can have important consequences as the follow- (e.g., first-price versus second-price). Third, we ing simple example demonstrates: consider informal auctions, in which the seller cannot commit to an auction mechanism in Consider an auction in which two bidders, advance. Alice and Bob, compete for a project. The The structure of the paper is as follows. The project requires an initial fixed investment basic model is described in Section I. We begin that is equivalent to $1M (we can inter- our analysis in Section II by examining formal pret some or all of this amount as a min- mechanisms, which consist of both an auction imum up-front cash payment required by format and a security design. There we establish the seller). Alice expects that if she un- dertakes the project, then on average it the following results: would yield cash flows of $4M; Bob ex- pects future cash flows of only $3M. As- ● We characterize super-modularity conditions suming these estimates are private values, under which a monotone—and hence effi- in a standard second-price auction it is a cient—equilibrium is the unique outcome for dominant strategy for bidders to bid their the first- and second-price auctions. 938 THE AMERICAN ECONOMIC REVIEW SEPTEMBER 2005 ● First we compare security designs holding ● In the unique equilibrium satisfying standard fixed the auction format (first- or second- refinements of off-equilibrium beliefs, bid- price). We show that for either format, the ders use the “flattest” securities available, seller’s expected revenues are positively re- e.g., cash or debt. Moreover, the outcome is lated to the “steepness” (a notion that we equivalent to a first-price auction. As a result, define) of the securities. As a result, debt we conclude that this ex post maximization contracts minimize the seller’s expected pay- yields the worst possible outcome for the offs while call options maximize it.
Recommended publications
  • 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]
  • Ascending Auctions with Package Bidding
    Frontiers of Theoretical Economics Volume 1, Issue 1 2002 Article 1 Ascending Auctions with Package Bidding Lawrence M. Ausubel∗ Paul R. Milgrom† ∗University of Maryland, [email protected] †Stanford University, [email protected] Copyright c 2002 by the authors. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, elec- tronic, mechanical, photocopying, recording, or otherwise, without the prior written permis- sion of the publisher, bepress, which has been given certain exclusive rights by the author. Frontiers of Theoretical Economics is produced by The Berkeley Electronic Press (bepress). http://www.bepress.com/bejte Ascending Auctions with Package Bidding Lawrence M. Ausubel and Paul R. Milgrom Abstract A family of ascending package auction models is introduced in which bidders may determine their own packages on which to bid. In the proxy auction (revelation game) versions, the outcome is a point in the core of the exchange economy for the reported preferences. When payoffs are linear in money and goods are substitutes, sincere reporting constitutes a Nash equilibrium and the outcome coincides with the Vickrey auction outcome. Even when goods are not substitutes, ascending proxy auction equilibria lie in the core with respect to the true preferences. Compared to the Vickrey auction, the proxy auctions generate higher equilibrium revenues, are less vulnerable to shill bidding and collusion, can handle budget constraints much more robustly, and may provide better ex ante investment incentives. KEYWORDS: auction theory, FCC auctions, package bidding, combinatorial bidding, activity rule, bid Improvement rule, e-commerce, electronic commerce Ausubel and Milgrom: Ascending Package Auctions 1.
    [Show full text]
  • Auctions & Competitive Bidding
    Auctions & Competitive Bidding When planned and executed appropriately, auctions and other competitive market mechanisms can achieve important objectives in selling or acquiring products, assets, resources, rights, and obligations. However, expertise, experience, and reputation are needed to ensure success. For two decades, CRA has designed, conducted, and monitored high-stakes auctions and other competitive transaction mechanisms in many industries and in more than a dozen countries. Our consultants also have helped clients participate successfully in auctions. Whether you want to maximize the value of your assets, minimize your procurement costs, or achieve other objectives, you’ll find the expertise, experience, reputation, and support you need at CRA. Full range of services software such as our Auction Management System (AMS), CRA provides a complete range of services to ensure success. demos, mock auctions, training, and hosting services for auctions We combine theory, market analysis, business principles, and and other trading events. We use our multilingual capabilities practical experience tailored to industry realities in developing and experience to conduct trading events in several languages. and implementing strategies and market mechanisms that best CRA has designed and managed more than 150 successful meet clients’ objectives. We achieve lower information and trading events with transaction values ranging from hundreds transaction costs, improved market information, increased of thousands to billions of dollars. value, lower costs, and improved price realizations that benefit sellers and buyers. This enhances seller-buyer relationships and Auction software, trading platforms, and hosting enables market participants to make better business decisions, CRA develops and customizes software applications, systems, invest their resources and assets more profitably, and manage trading platforms, and tools used to manage auctions and their risks better.
    [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]
  • February 24, 2021 FCC FACT SHEET* Competitive Bidding Procedures for Auction
    February 24, 2021 FCC FACT SHEET* Competitive Bidding Procedures for Auction 110 (Flexible-Use Service Licenses in the 3.45–3.55 GHz Band) Public Notice – AU Docket No. 21-62 Background: This Public Notice would propose application and bidding procedures for Auction 110, an auction of flexible-use licenses for spectrum in the 3.45–3.55 GHz band, subject to cooperative sharing requirements to protect federal incumbents. We expect the bidding for licenses in Auction 110 to commence in early October 2021. The auction would offer up to 100 megahertz of spectrum on an unpaired basis and divided into five 20-megahertz blocks licensed by Partial Economic Area (PEA) service area. Initiating the preauction processes for assigning licenses in Auction 110 would be another important step towards releasing critical mid-band spectrum to the commercial market and furthering the deployment of fifth-generation (5G) wireless and other advanced spectrum-based services for the benefit of the public, as well as continuing the implementation of our Congressional mandate to commence an auction of 3.45 GHz band spectrum by December 31, 2021. What the Public Notice Would Do: • Propose procedures for the clock and assignment phases of Auction 110. The clock phase would allow bidding on generic blocks in each PEA in successive clock bidding rounds. The assignment phase would allow bidding for frequency-specific license assignments. • Propose to use a single bidding category of generic blocks in the 334 PEAs where all five blocks are the same—i.e., all are subject to the same requirements or to none—and two bidding categories in the 72 PEAs where requirements differ between two subsets of blocks.
    [Show full text]
  • Reforming CMS' Competitive Bidding Process to Improve Quality and Sustainability
    Reforming CMS’ Competitive Bidding Process to Improve Quality and Sustainability BY WAYNE WINEGARDEN Reforming CMS’ Competitive Bidding Process to Improve Quality and Sustainability BY WAYNE WINEGARDEN JULY 2018 Reforming CMS’ Competitive Bidding Process to Improve Quality and Sustainability by Wayne Winegarden July 2018 Pacific Research Institute 101 Montgomery Street, Suite 1300 San Francisco, CA 94104 Tel: 415-989-0833 Fax: 415-989-2411 www.pacificresearch.org Download copies of this study at www.pacificresearch.org. Nothing contained in this report is to be construed as necessarily reflecting the views of the Pacific Research Institute or as an attempt to thwart or aid the passage of any legislation. ©2018 Pacific Research Institute. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopy, recording, or otherwise, without prior written consent of the publisher. Contents Introduction and Summary ..................................................................................5 CMS’ Current Bidding Structure Is Inefficient ....................................................6 The Empirical Evidence Against CMS’ Current Bidding Process .....................10 Conclusion: Reforms to the Competitive Bidding Program Are Necessary ......13 Endnotes ...........................................................................................................16 About the Author ...............................................................................................19
    [Show full text]
  • Guidelines for Fighting Bid Rigging in Public
    For further information about the Guidelines for Fighting Bid Rigging in Public Procurement, please contact: GUIDELINES FOR FIGHTING BID RIGGING Ken Danger Antonio Capobianco Competition Division Competition Division IN PUBLIC PROCUREMENT OECD OECD 2, Rue André Pascal 2, Rue André Pascal Helping governments to obtain best value for money 75016 Paris France 75016 Paris France Tel: +33 1 45 24 82 50 Tel: +33 1 45 24 98 08 Fax: +33 1 45 24 96 95 Fax: +33 1 45 24 96 95 [email protected] [email protected] www.oecd.org/competition COMPETITION – THE KEY TO PRODUCTIVITY AND GROWTH 1. INTRODUCTION Bid rigging (or collusive tendering) occurs when businesses, that would otherwise be expected to compete, secretly conspire to raise prices or lower the quality of goods or services for purchasers who wish to acquire products or services through a bidding process. Public and private organizations often rely upon a competitive bidding process to achieve better value for money. Low prices and/or better products are desirable because they result in resources either being saved or freed up for use on other goods and services. The competitive process can achieve lower prices or better quality and innovation only when companies genuinely compete (i.e., set their terms and conditions honestly and independently). Bid rigging can be particularly harmful if it affects public procurement.1 Such conspiracies take resources from purchasers and taxpayers, diminish public confidence in the competitive process, and undermine the benefits of a competitive marketplace. Bid rigging is an illegal practice in all OECD member countries and can be investigated and sanctioned under the competition law and rules.
    [Show full text]
  • Algorithmic Game Theory
    Algorithmic Game Theory Edited by Noam Nisan, Tim Roughgarden, Eva´ Tardos, and Vijay Vazirani Contents 1 Sponsored Search Auctions S. Lahaie, D. Pennock, A. Saberi, R. Vohra page 4 Attachment converted: Macintosh HD:overture-lvtravel-results.png (PNGf/prvw) (00376E01) 3 1 Sponsored Search Auctions S´ebastienLahaie, David M. Pennock, Amin Saberi, and Rakesh Vohra Abstract 1.1 Introduction Sponsored search is a form of advertising typically sold at auction where merchants bid for positioning alongside web search results. For example, when a user queries a web search engine like Google or Yahoo! for “iPod”, advertisers (Apple Computer, Best Buy, eBay, etc.) may bid to have their listings featured alongside the standard “algorithmic” search listings. The advertisements appear in a separate section of the page designated as “spon- sored” above or to the right of the algorithmic results. The sponsored search results are displayed in a format similar to algorithmic results: as a list of items each containing a title, a text description, and a hyperlink to a cor- responding web page. We call each position in the list a slot. Generally, advertisements that appear in a higher ranked slot (higher on the page) garner more attention and more clicks from users. Thus, all else being equal, merchants generally prefer higher ranked slots to lower ranked slots. Figure 1.1(a) shows an example layout of sponsored search results for the query “las vegas travel”. Figure 1.1(b) shows the advertisers’ bids in the corresponding auction. Advertisers bid for placement on the page in an auction-style format where the larger their bid the more likely their listing will appear above other ads on the page.
    [Show full text]
  • Penny Auctions Are Unpredictable
    ISSN 2279-9362 Penny Auctions are Unpredictable Toomas Hinnosaar No. 305 October 2013 www.carloalberto.org/research/working-papers © 2013 by Toomas Hinnosaar. Any opinions expressed here are those of the authors and not those of the Collegio Carlo Alberto. Penny Auctions are Unpredictable∗ Toomas Hinnosaar† October 2013 Abstract I study an auction format called penny auctions. In these auctions, every bid increases the price by a small amount, but it is costly to place a bid. The auction ends if more than some predetermined amount of time has passed since the last bid. Outcomes of real penny auctions are surprising: even selling cash can give the seller an order of magnitude higher or lower revenue than the nominal value. Sometimes the winner of the auction pays very little compared to many of the losers at the same auction. The unexpected outcomes have led to the accusations that the penny auction sites are either scams or gambling or both. I propose a tractable model of penny auctions and show that the high variance of outcomes is a property of the auction format. Even absent of any randomization, the equilibria in penny auctions are close to lotteries from the buyers’ perspective. JEL: D11, D44, C73 Keywords: penny auction, Internet auctions, bid fees, gambling 1 Introduction A typical penny auction1 sells a new brand-name gadget, at a starting price of $0 and a timer at 1 minute. When the auction starts, the timer starts to tick down and players may submit bids. Each bid costs $1 to the bidder, increases price by $0.01, and resets the timer to 1 minute.
    [Show full text]
  • Types-Of-Auctions-1.Pdf
    Auction Types English Auction: This is what most people think of as an auction. Participants bid openly against one another, with each bid being higher than the previous bid. The auction ends when no participant is willing to bid further, or when a pre- determined "buy-out" price is reached, at which point the highest bidder pays the price. The seller may set a 'reserve' price, and if the auctioneer fails to raise a bid higher than this reserve the sale may not go ahead. Dutch Auction: In a traditional Dutch auction, the auctioneer begins with a high asking price which is lowered until some participant is willing to accept the auctioneer's price, or a predetermined minimum price is reached. That participant pays the last announced price. This type of auction is convenient when it is important to auction goods quickly, since a sale never requires more than one bid. The Dutch auction is named for its best known example, the Dutch tulip auctions; in the Netherlands this type of auction is actually known as a "Chinese Auction". "Dutch Auction" is also sometimes used to describe online auctions where several identical goods are sold simultaneously to an equal number of high bidders. Economists call the latter auction a multi-unit English ascending auction. Sealed First-Price Auction: Also known as Sealed High-Bid Auction or First-Price Sealed-Bid Auction (FPSB). In this type of auction all bidders simultaneously submit bids so that no bidder knows the bid of any other participant. The highest bidder pays the price they submitted.
    [Show full text]
  • Carbon Allowance Auction Design: an Assessment of Options for the U.S
    Carbon Allowance Auction Design: An Assessment of Options for the U.S. Giuseppe Lopomo1 Duke University Leslie M. Marx2 Duke University David McAdams3 Duke University Brian Murray4 Duke University Abstract Carbon allowance auctions are a component of existing and proposed regional cap-and-trade programs in the U.S. and are also included in recent bills in the U.S. Congress that would establish a national cap-and-trade program to regulate greenhouse gases (“carbon”). We discuss and evaluate the two leading candidates for auction format: a uniform-price sealed- bid auction and an ascending-bid dynamic auction, either of which could be augmented with a “price collar” to ensure that the price of allowances is neither too high nor too low. We identify the primary trade-offs between these two formats as applied to carbon allowance auctions and suggest additional auction design features that address potential concerns about efficiency losses from collusion and other factors. We conclude that, based on currently available evidence, a uniform-price sealed-bid auction is more appropriate for the sale of carbon allowances than the other leading auction formats, in part because it offers increased robustness to collusion without significant sacrifice of price discovery. JELClassification Codes: D44, H23, P48 Keywords: cap and trade, global warming, carbon permits, tradable permits 1Fuqua School of Business, Duke University, Durham, NC 27708, [email protected]. 2Fuqua School of Business, Duke University, Durham, NC 27708, [email protected]. 3Fuqua School of Business, Duke University, Durham, NC 27708, [email protected]. 4Nicholas Institute for Environmental Policy Solutions and Nicholas School of the Environment, Duke University, Durham, NC 27708, [email protected].
    [Show full text]
  • Pricing and Bidding Strategies in Iterative Combinatorial Auctions
    Institut f¨urInformatik der Technischen Universit¨atM¨unchen Lehrstuhl f¨urInformatik XVIII Pricing and Bidding Strategies in Iterative Combinatorial Auctions Alexander Pikovsky Vollst¨andiger Abdruck der von der Fakult¨atf¨urInformatik der Technischen Universit¨at M¨unchen zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften (Dr. rer. nat.) genehmigten Dissertation. Vorsitzender: Univ.-Prof. Michael Beetz, Ph.D. Pr¨uferder Dissertation: 1. Univ.-Prof. Dr. Martin Bichler 2. Univ.-Prof. Alfons Kemper, Ph.D. Die Dissertation wurde am 30.01.2008 bei der Technischen Universit¨at M¨unchen eingereicht und durch die Fakult¨atf¨urInformatik am 07.07.2008 angenommen. For Vita Pikovskaya Abstract Auctions have been getting increasing attention in computer science and eco- nomics, as they provide an efficient solution to resource allocation problems with self-interested agents. E-Commerce and finance have emerged as some of their largest application fields. The need for new auction mechanisms that allow for complex bids such as bundle bids and multi-attribute bids has been raised in many situations. In addition to strategic problems, the design of these multidimensional auctions exhibits hard computational problems. For example, the winner determination typically leads to NP-hard allocation prob- lems in combinatorial auctions. More recently, researchers have focused on the pricing and information feedback in combinatorial auctions. Iterative combinatorial auctions (ICAs) are IT-based economic mechanisms in which bidders submit bundle bids iteratively and the auctioneer computes allocations and ask prices in each auction round. Several ICA designs have been proposed in the literature, but very little was known about their behavior in different settings.
    [Show full text]