Book•
Auctions and Auctioneering
28 May 2021-
About: The article was published on 2021-05-28 and is currently open access. It has received 450 citations till now. The article focuses on the topics: Common value auction.
Citations
More filters
TL;DR: In this article, a new general auction model was proposed, and the properties of affiliated random variables were investigated, and various theorems were presented in Section 4-8 and Section 9.
Abstract: : In Section 2, we review some important results of the received auction theory, introduce a new general auction model, and summarize the results of our analysis. Section 3 contains a formal statement of our model, and develops the properties of affiliated random variables. The various theorems are presented in Sections 4-8. In Section 9, we offer our views on the current state of auction theory. Following Section 9 is a technical appendix dealing with affiliated random variables.
3,857Â citations
Cites background from "Auctions and Auctioneering"
...After XO is publicly announced, a new conditional joint density f(s1, . . . , s,,,, x1, . . . , x, xo) applies to the random elements of the model, and it is straightforward to verify that the conditional density satisfies the affiliation inequality....
[...]
Book•
15 Dec 2008TL;DR: This exciting and pioneering new overview of multiagent systems, which are online systems composed of multiple interacting intelligent agents, i.e., online trading, offers a newly seen computer science perspective on multi agent systems, while integrating ideas from operations research, game theory, economics, logic, and even philosophy and linguistics.
Abstract: This exciting and pioneering new overview of multiagent systems, which are online systems composed of multiple interacting intelligent agents, i.e., online trading, offers a newly seen computer science perspective on multiagent systems, while integrating ideas from operations research, game theory, economics, logic, and even philosophy and linguistics. The authors emphasize foundations to create a broad and rigorous treatment of their subject, with thorough presentations of distributed problem solving, game theory, multiagent communication and learning, social choice, mechanism design, auctions, cooperative game theory, and modal logics of knowledge and belief. For each topic, basic concepts are introduced, examples are given, proofs of key results are offered, and algorithmic considerations are examined. An appendix covers background material in probability theory, classical logic, Markov decision processes and mathematical programming. Written by two of the leading researchers of this engaging field, this book will surely serve as THE reference for researchers in the fastest-growing area of computer science, and be used as a text for advanced undergraduate or graduate courses.
2,068Â citations
Book•
01 Jan 2004TL;DR: This book provides a comprehensive introduction to modern auction theory and its important new applications and explores the tension between the traditional theory of auctions with a fixed set of bidders and the theory of Auction with endogenous entry, in which bidder profits must be respected to encourage participation.
Abstract: 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.
1,287Â citations
TL;DR: In this article, Klemperer et al. provide an elementary, non-technical, survey of auction theory, by introducing and describing some of the critical papers in the subject.
Abstract: This paper provides an elementary, non-technical, survey of auction theory, by introducing and describing some of the critical papers in the subject. (The most important of these are reproduced in a companion book, The Economic Theory of Auctions, Paul Klemperer (ed.), Edward Elgar (pub.), forthcoming.); We begin with the most fundamental concepts, and then introduce the basic analysis of optimal auctions, the revenue equivalence theorem, and marginal revenues. Subsequent sections address risk-aversion, affiliation, asymmetries, entry, collusion, multi-unit auctions, double auctions, royalties, incentive contracts, and other topics. Appendices contain technical details, some simple worked examples, and a bibliography for each section.
1,246Â citations
TL;DR: In this article, the authors proposed a new ascending-bid auction for homogeneous goods, such as Treasury bills or telecommunications spectrum, where items are awarded at the current price whenever they are "clinched," and the price is incremented until the market clears.
Abstract: When bidders exhibit multi-unit demands, standard auction methods generally yield inefficient outcomes. This article proposes a new ascending-bid auction for homogeneous goods, such as Treasury bills or telecommunications spectrum. The auctioneer announces a price and bidders respond with quantities. Items are awarded at the current price whenever they are "clinched," and the price is incremented until the market clears. With private values, this (dynamic) auction yields the same outcome as the (sealed-bid) Vickrey auction, but has advantages of simplicity and privacy preservation. With interdependent values, this auction may retain efficiency, whereas the Vickrey auction suffers from a generalized Winner's Curse.
779Â citations