Incentive analysis of approximately efficient allocation algorithms
暂无分享,去创建一个
We present a series of results providing evidence that the incentive problem with approximate VCG-based mechanisms is often not very severe. Our first result uses average-case analysis to show that if an algorithm can solve the allocation problem well for a large proportion of instances, incentives to lie essentially disappear. We next show that even if such incentives exist, a simple enhancement of the mechanism makes it unlikely that any player will find an improving deviation. Additionally, we offer a simulation-based technique to verify empirically the incentive properties of an arbitrary approximation algorithm and demonstrate it in a specific instance using combinatorial auction data.
[1] Daniel Lehmann,et al. Linear Programming helps solving large multi-unit combinatorial auctions , 2002, ArXiv.
[2] Yoav Shoham,et al. A Test Suite for Combinatorial Auctions , 2005 .
[3] Michel Gendreau,et al. Combinatorial auctions , 2007, Ann. Oper. Res..