Collusion-Resilient Revenue In Combinatorial Auctions
msra(2007)
摘要
Abstract In auctions of a single good, the second-price mechanism achieves, in dominant strategies, a revenue benchmark that is naturally high and resilient to any possible collusion. We show how to achieve, to the maximum extent possible, the same properties in combinatorial auctions. This Technical Memo improves on material submitted to FOCS 2007, SODA 2008, and the Library of Congress. 1 The Problem of Guaranteeing Revenue in Combinatorial Auctions
更多查看译文
关键词
combinatorial auction
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络