A New Payment Rule for Core-Selecting Package Auctions
暂无分享,去创建一个
[1] Aytek Erdil,et al. A New Payment Rule for Core-Selecting Package Auctions , 2009 .
[2] Kalyan Chatterjee,et al. Bargaining under Incomplete Information , 1983, Oper. Res..
[3] Lawrence M. Ausubel,et al. The Clock-Proxy Auction: A Practical Combinatorial Auction Design , 2004 .
[4] David C. Parkes,et al. Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges , 2001, IJCAI.
[5] John O. Ledyard,et al. Optimal combinatoric auctions with single-minded bidders , 2007, EC '07.
[6] David C. Parkes,et al. Iterative Combinatorial Auctions: Theory and Practice , 2000, AAAI/IAAI.
[7] Paul Klemperer,et al. Auctions: Theory and Practice , 2004 .
[8] Peter Cramton,et al. The Quadratic Core-Selecting Payment Rule for Combinatorial Auctions , 2008 .
[9] S. Raghavan,et al. Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions , 2007, Manag. Sci..
[10] P. Klemperer. The Product-Mix Auction: A New Auction Design for Differentiated Goods , 2010 .
[11] Lawrence M. Ausubel,et al. The Lovely but Lonely Vickrey Auction , 2004 .
[12] Paul Milgrom,et al. Assignment Messages and Exchanges , 2009 .
[13] Lawrence M. Ausubel,et al. Ascending Auctions with Package Bidding , 2002 .
[14] Paul Milgrom,et al. Core-selecting package auctions , 2008, Int. J. Game Theory.
[15] Paul Klemperer,et al. A New Auction for Substitutes: Central-Bank Liquidity Auctions, 'Toxic Asset' Auctions, and Variable Product-Mix Auctions , 2009 .
[16] D. Parkes,et al. Quantifying the Strategyproofness of Mechanisms via Metrics on Payoff Distributions , 2009, UAI.
[17] M. Satterthwaite,et al. Efficient Mechanisms for Bilateral Trading , 1983 .