Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for all Distributi
summary
New auction ADRA claims a single-item mechanism that is revenue-optimal, incentive-compatible for bidders and credible for the seller for all distributions, by combining cryptographic commitments with dynamic deposits that grow per round. It replaces DRA’s fixed deposit (which fails on equal-revenue examples) with multiplicative increments so expected communication is constant; ADRA yields exponential improvements over ascending-price auctions and, for example, on equal-revenue draws setting the multiplicative step ≈N collapses expected rounds to O(1).
AI-written summary · about
chapters (20)
- 0:00Auction design challenges
- 1:08First-price auction limits
- 2:13Second-price auctions credibility
- 3:18Credibility and truthfulness
- 4:26Holt’s dilemma trade-offs
- 5:54Constant-round optimal auctions
- 6:59Deferred Revelation Auction commitments
- 8:05Research question ADRA intro
- 8:48Single-item auction assumptions
- 9:53Ascending DRA overview
- 10:34DRA fails for regular distributions
- 13:01Dynamic deposits bounded dist
- 14:29ADRA step-by-step
- 17:22ADRA vs ascending price DRA
- 19:33ADRA key properties
- 20:41Communication complexity gains
- 21:45Constant rounds multiplicative
- 22:50Constant-round performance examples
- 23:34ADRA main results recap
- 24:18Conclusion future research
related talks
20mPrivate Bids, Public Proofs: A New Onchain Auction Design
15mAuctions, privacy and a cat
34mEfficient Robust Private Aggregation for DP
28mLet's start a RAI-ot!
32mPeeking into the Future: MPC Resilient to Super-Rushing Adversaries
31mBroadcast Optimal Multi-Party Computation
28mAsynchronous Distributed Key Generation
58mBlockchains and Publicly-Verifiable Lotteries