Sciweavers

44 search results - page 1 / 9
» Mechanism Design for Complexity-Constrained Bidders
Sort
View
WINE
2009
Springer
194views Economy» more  WINE 2009»
13 years 11 months ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 2 months ago
Optimal Auctions with Correlated Bidders are Easy
We consider the problem of designing a revenue-maximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there...
Shahar Dobzinski, Hu Fu, Robert Kleinberg
AAAI
2012
11 years 7 months ago
Optimal Auctions for Spiteful Bidders
Designing revenue-optimal auctions for various settings is perhaps the most important, yet sometimes most elusive, problem in mechanism design. Spiteful bidders have been intensel...
Pingzhong Tang, Tuomas Sandholm
WINE
2010
Springer
134views Economy» more  WINE 2010»
13 years 2 months ago
Truthful Mechanisms for Exhibitions
We consider the following combinatorial auction: Given a range space (U, R), and m bidders interested in buying only ranges in R, each bidder j declares her bid bj : R R+. We give...
George Christodoulou, Khaled M. Elbassioni, Mahmou...
WECWIS
2003
IEEE
97views ECommerce» more  WECWIS 2003»
13 years 10 months ago
Auctions with Untrustworthy Bidders
The paper analyzes auctions which are not completely enforceable. In such auctions, economic agents may fail to carry out their obligations, and parties involved cannot rely on ex...
Sviatoslav Braynov, Tuomas Sandholm