ABSTRACT
We study the following problem: A seller wishes to sell an item to a group of self-interested agents. Each agent i has a privately known valuation vi for the object. Given a distribution on these valuations, our goal is to construct an auction that maximizes the seller's expected revenue (optimal auction). The auction must be incentive compatible and satisfy individual rationality. We present a simple generic auction that guarantees at least half of the optimal revenue. We generalize this result in several directions, in particular, for the case of multiple copies with unit demand. Our auction requires the ability to learn (or compute) in polynomial time the conditional distribution of the agent with the maximal valuation, given the valuations of the other agents. We show that this ability is in some sense essential. Finally we suggest a generalization of our auction and argue that it will generate a revenue which is close to optimal for reasonable distributions. In particular we show this under an independence assumption
- 1.Jacques Cremer and McLean Richard.Optimal selling strategies under uncertainty for a discriminating monopolist when demands are nterpendent. Econometrica ,53:345 -61,1985.]]Google ScholarCross Ref
- 2.A.V.Goldberg,J.D.Hartline,and A.Wright. Competitive auctions for multiple digital goods. Technical report,Technical Report STAR-TR-00.05-02,InterTrust Technologies Corp, 2000.]]Google Scholar
- 3.A.V.Goldberg,J.D.Hartline,and A.Wright. Competitive auctions and digital goods.In 12th Annual ACM-SIAM Symposium on Discrete Algorithms ,January 2001.]] Google ScholarDigital Library
- 4.O.Goldreich,S.Goldwasser,and S.Michali.How to construct pseudo random functions.In The 25th Symp.on foundations of computer science ,pages 464 -479,1984.]]Google Scholar
- 5.Oded Goldreich.The foundations of cryptography. http://www.wisdom.weizmann.ac.il/oded/focbook.html.]]Google Scholar
- 6.Paul Klemperer.Auction theory:a guide to the literature.Journal of economic surveys ,pages 227 -286,1999.]]Google Scholar
- 7.Paul Klemperer.The economic theory of auctions . Edward Elgar Publishing,2000.]]Google Scholar
- 8.Daniel Lehmann,Liadan O 'Callaghan,and Yoav Shoham.Truth revelation n rapid,approximately efficient combinatorial auctions.In ACM Conference on Electronic Commerce (EC-99),pages 96 -102, November 1999.]] Google ScholarDigital Library
- 9.A.Mas-Collel,Whinston W.,and J.Green. Microeconomic Theory .Oxford university press,1995.]]Google Scholar
- 10.R.B.Myrson.Optimal auction design.Mathematics of operational research ,6:58 -73,1981.]]Google Scholar
- 11.Amir Ronen.Algorithms for rational agents.In Proc. of the 27th Annual Conference on Current Trends in Theory and Practice of Informatics ,2000.]] Google ScholarDigital Library
- 12.W.Vickrey.Counterspeculation,auctions and competitive sealed tenders.Journal of Finance ,pages 8-37, 1961.]]Google Scholar
Index Terms
- On approximating optimal auctions
Recommendations
Approximating optimal combinatorial auctions for complements using restricted welfare maximization
IJCAI'11: Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume OneThe VCG mechanism is the gold standard for combinatorial auctions (CAs), and it maximizes social welfare. In contrast, the revenue-maximizing (aka optimal) CA is unknown, and designing one is NP-hard. Therefore, research on optimal CAs has progressed ...
Simple, Credible, and Approximately-Optimal Auctions
EC '20: Proceedings of the 21st ACM Conference on Economics and ComputationWe present a general framework for designing approximately revenue-optimal mechanisms for multi-item additive auctions. Our approach adapts the duality framework of Cai, Devanur and Weinberg (STOC 2016) and applies to both truthful and non-truthful ...
Optimal auctions for partially rational bidders
IJCAI'15: Proceedings of the 24th International Conference on Artificial IntelligenceWe investigate the problem of revenue optimal mechanism design [Myerson, 1981] under the context of the partial rationality model, where buyers randomize between two modes: rational and irrational. When a buyer is irrational (can be thought of as lazy), ...
Comments