Mechanism Design for Optimal Auctions PDF Download

Author: Wenying Hu
Publisher:
ISBN:
Category : Internet auctions
Languages : en
Pages : 102

View

Book Description

Author: Zhu Han
Publisher: Cambridge University Press
ISBN: 0521196965
Category : Business & Economics
Languages : en
Pages : 555

View

Book Description
This unified 2001 treatment of game theory focuses on finding state-of-the-art solutions to issues surrounding the next generation of wireless and communications networks. The key results and tools of game theory are covered, as are various real-world technologies and a wide range of techniques for modeling, design and analysis.

Author: Paul Milgrom
Publisher: Cambridge University Press
ISBN: 1139449168
Category : Business & Economics
Languages : en
Pages : 378

View

Book Description
This book provides a comprehensive introduction to modern auction theory and its important new applications. It is written by a leading economic theorist whose suggestions guided the creation of the new spectrum auction designs. Aimed at graduate students and professionals in economics, the book gives the most up-to-date treatments of both traditional theories of 'optimal auctions' and newer theories of multi-unit auctions and package auctions, and shows by example how these theories are used. The analysis explores the limitations of prominent older designs, such as the Vickrey auction design, and evaluates the practical responses to those limitations. It explores the tension between the traditional theory of auctions with a fixed set of bidders, in which the seller seeks to squeeze as much revenue as possible from the fixed set, and the theory of auctions with endogenous entry, in which bidder profits must be respected to encourage participation.

Author: Christos Tzamos
Publisher:
ISBN:
Category :
Languages : en
Pages : 64

View

Book Description
Myerson's seminal work provides a computationally efficient revenue-optimal auction for selling one item to multiple bidders. Generalizing this work to selling multiple items at once has been a central question in economics and algorithmic game theory, but its complexity has remained poorly understood. We answer this question by showing that a revenue-optimal auction in multi-item settings cannot be found and implemented computationally efficiently, unless ZPP = P^#^p. This is true even for a single additive bidder whose values for the items are independently distributed on two rational numbers with rational probabilities. Our result is very general: we show that it is hard to compute any encoding of an optimal auction of any format (direct or indirect, truthful or non-truthful) that can be implemented in expected polynomial time. In particular, under well-believed complexity-theoretic assumptions, revenue-optimization in very simple multi-item settings can only be tractably approximated. We note that our hardness result applies to randomized mechanisms in a very simple setting, and is not an artifact of introducing combinatorial structure to the problem by allowing correlation among item values, introducing combinatorial valuations, or requiring the mechanism to be deterministic (whose structure is readily combinatorial). Our proof is enabled by a flow interpretation of the solutions of an exponential-size linear program for revenue maximization with an additional supermodularity constraint.

Author: Tilman Borgers
Publisher: Oxford University Press
ISBN: 0190244682
Category : Business & Economics
Languages : en
Pages : 263

View

Book Description
What is the best way to auction an asset? How should a group of people organize themselves to ensure the best provision of public goods? How should exchanges be organized? In An Introduction to the Theory of Mechanism Design, Tilman Börgers addresses these questions and more through an exploration of the economic theory of mechanism design. Mechanism design is reverse game theory. Whereas game theory takes the rules of the game as a given and makes predictions about the behavior of strategic players, the theory of mechanism design goes a step further and selects the optimal rules of the game. A relatively new economic theory, mechanism design studies the instrument itself as well as the results of the instrument. An Introduction to the Theory of Mechanism Design provides rigorous but accessible explanations of classic results in the theory of mechanism design, such as Myerson's theorem on expected revenue maximizing auctions, Myerson and Satterthwaite's theorem on the impossibility of ex post efficient bilateral trade with asymmetric information, and Gibbard and Satterthwaite's theorem on the non-existence of dominant strategy voting mechanisms. Börgers also provides an examination of the frontiers of current research in the area with an original and unified perspective that will appeal to advanced students of economics.

Author: Flavio M. Menezes
Publisher: Oxford University Press, USA
ISBN: 0199275998
Category : Business & Economics
Languages : en
Pages : 200

View

Book Description
This book provides a step-by-step, self-contained treatment of auction theory and aims to provide an introductory treatment to allow students to work through all the basic results. The techniques and insights gained provide a useful starting point for those wanting to venture into information economics, mechanism design and regulatory economics.

Author: Hedyeh Beyhaghi
Publisher:
ISBN:
Category :
Languages : en
Pages : 179

View

Book Description
Algorithmic mechanism design is an interdisciplinary field, concerned with the design of algorithms that are used by strategic agents. This field has applications in many real-world settings, such as auction design, search problems, and matching markets. In this thesis we study the mechanisms in these areas through lenses of simplicity and practicality. We pursue two main directions: study the strength of simple mechanisms, and improve the efficiency of practical mechanisms. In auction design, we consider a setting where a seller wants to sell many items to many buyers, and establish a tight gap between the efficiency of a simple and commonly-used auction with the complicated revenue-optimal auction. In search theory context, we introduce Pandora's problem with alternative inspections and provide the first approximately-optimal mechanism for this problem. In Pandora's problem with alternative inspections, a searcher wants to select one out of n elements whose values are unknown ahead of time. The searcher evaluates the elements one by one and can choose among different costly ways to evaluate each element, the order to evaluate the elements, and how long to continue the search, in order to maximize her utility. In matching markets, we propose theoretical models that closely capture the participant behaviors in the real world, and provide methods to optimize the already implemented mechanisms.

Author: Akitoshi Muramoto
Publisher:
ISBN:
Category :
Languages : en
Pages : 0

View

Book Description
We study optimal auctions with expectation-based loss-averse bidders. We first consider when bidders are ex-ante identical. Although symmetric designs are optimal for bidders with expected-utility preferences, if the degree of loss aversion is sufficiently large relative to the variation in valuations, expected revenues are higher in the optimal design with one buyer than in any symmetric mechanism with multiple bidders. Further, we provide a sufficient condition under which optimal mechanisms are necessarily asymmetric. When bidders are ex-ante heterogeneous, the optimal degree of favoritism must be modified from the level in Myerson (1981) to reduce the uncertainty in auction outcomes. Not only the degree of the required modification but also the direction of the modification may not be monotone in the degree of loss aversion.

Author: Xianwen Shi
Publisher:
ISBN:
Category :
Languages : en
Pages : 36

View

Book Description
This paper studies optimal auction design in a private value setting with endogenous information gathering. We develop a general framework for modeling information acquisition when a seller wants to sell an object to one of several potential buyers, who can each gather information about their valuations prior to participation in the auction. We first demonstrate that the optimal monopoly price is always lower than the standard monopoly price. We then show that standard auctions with a reserve price remain optimal among symmetric mechanisms, but the optimal reserve price lies between the ex ante mean valuation of bidders and the standard reserve price in Myerson (1981). Finally, we show that the optimal asymmetric mechanism softens the price discrimination against quot;strongquot; bidders.

Author: Dirk Bergemann
Publisher: World Scientific
ISBN: 981437458X
Category : Business & Economics
Languages : en
Pages : 471

View

Book Description
Foreword by Eric Maskin (Nobel Laureate in Economics, 2007)This volume brings together the collected contributions on the theme of robust mechanism design and robust implementation that Dirk Bergemann and Stephen Morris have been working on for the past decade. The collection is preceded by a comprehensive introductory essay, specifically written for this volume with the aim of providing the readers with an overview of the research agenda pursued in the collected papers.The introduction selectively presents the main results of the papers, and attempts to illustrate many of them in terms of a common and canonical example, namely a single unit auction with interdependent values. It is our hope that the use of this example facilitates the presentation of the results and that it brings the main insights within the context of an important economic mechanism, namely the generalized second price auction.