Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions
Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions
复制标题
确定性、主导策略组合拍卖中的收入单调性
DOI:
10.1016/j.artint.2010.08.005
复制
发表时间:
2011
期刊:
影响因子:
--
通讯作者:
Kevin Leyton
中科院分区:
文献类型:
--
作者:
Baharak Rastegari;A. Condon;Kevin Leyton
In combinatorial auctions using VCG, a seller can sometimes increase revenue by dropping bidders. In this paper we investigate the extent to which this counterintuitive phenomenon can also occur under other deterministic, dominant-strategy combinatorial auction mechanisms. Our main result is that such failures of “revenue monotonicity” can occur under any such mechanism that is weakly maximal—meaning roughly that it chooses allocations that cannot be augmented to cause a losing bidder to win without hurting winning bidders—and that allows bidders to express arbitrary known single-minded preferences. We also give a set of other impossibility results as corollaries, concerning revenue when the set of goods changes, false-name-proofness, and the core.1