Prior-free clock auctions for bidders with interdependent values
From MaRDI portal
Publication:2670908
Abstract: We study the problem of selling a good to a group of bidders with interdependent values in a prior-free setting. Each bidder has a signal that can take one of different values, and her value for the good is a weakly increasing function of all the bidders' signals. The bidders are partitioned into expertise-groups, based on how their signal can impact the values for the good, and we prove upper and lower bounds regarding the approximability of social welfare and revenue for a variety of settings, parameterized by and . Our lower bounds apply to all ex-post incentive compatible mechanisms and our upper bounds are all within a small constant of the lower bounds. Our main results take the appealing form of ascending clock auctions and provide strong incentives by admitting the desired outcomes as obvious ex-post equilibria.
Recommendations
Cites work
- A Theory of Auctions and Competitive Bidding
- Approximation in mechanism design with interdependent values
- Auctions with interdependence and SOS: improved approximation
- Communications to the editor: Competitive bidding with disparate information
- Efficient Auctions
- Efficient Design with Interdependent Valuations
- scientific article; zbMATH DE number 4207454 (Why is no real title available?)
- Optimal Auction Design
Cited in
(5)
This page was built for publication: Prior-free clock auctions for bidders with interdependent values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2670908)