Average-case analysis of VCG with approximate resource allocation algorithms
暂无分享,去创建一个
[1] Robert B. Wilson. Game-Theoretic Analysis of Trading Processes. , 1985 .
[2] E. S. Pearson,et al. THE USE OF CONFIDENCE OR FIDUCIAL LIMITS ILLUSTRATED IN THE CASE OF THE BINOMIAL , 1934 .
[3] E. Maasland,et al. Auction Theory , 2021, Springer Texts in Business and Economics.
[4] Lillian Lee,et al. Fast context-free grammar parsing requires fast boolean matrix multiplication , 2001, JACM.
[5] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[6] Yevgeniy Vorobeychik,et al. Average-Case Analysis of Mechanism Design with Approximate Resource Allocation Algorithms , 2010, WINE.
[7] Anshul Kothar,et al. Approximately-strategyproof and tractable multi-unit auctions , 2003 .
[8] Noam Nisan,et al. Computationally feasible VCG mechanisms , 2000, EC '00.
[9] S. Raghavan,et al. Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions , 2007, Manag. Sci..
[10] Chaitanya Swamy,et al. Truthful and near-optimal mechanism design via linear programming , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[11] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[12] Noam Nisan,et al. Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract , 2002, AAAI 2002.
[13] D. Lehmann,et al. The Winner Determination Problem , 2003 .
[14] Peter Cramton,et al. The Quadratic Core-Selecting Payment Rule for Combinatorial Auctions , 2008 .
[15] David Levine,et al. CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions , 2005, Manag. Sci..
[16] Daniel Lehmann,et al. Linear Programming helps solving large multi-unit combinatorial auctions , 2002, ArXiv.
[17] David C. Parkes,et al. Hard-to-Manipulate Combinatorial Auctions , 2004 .
[18] Subhash Suri,et al. Approximately-strategyproof and tractable multi-unit auctions , 2003, EC '03.
[19] Yoav Shoham,et al. A Test Suite for Combinatorial Auctions , 2005 .
[20] Yevgeniy Vorobeychik,et al. Incentive analysis of approximately efficient allocation algorithms , 2010, AAMAS.
[21] Michel Gendreau,et al. Combinatorial auctions , 2007, Ann. Oper. Res..
[22] Yoav Shoham,et al. Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.
[23] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[24] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[25] Noam Nisan,et al. Truthful approximation mechanisms for restricted combinatorial auctions , 2008, Games Econ. Behav..
[26] T. Bewley. Advances in Economic Theory: Fifth World Congress , 2009 .
[27] Noam Nisan,et al. Truthful randomized mechanisms for combinatorial auctions , 2006, STOC '06.