Frugal and Truthful Auctions for Vertex Covers, Flows and Cuts
暂无分享,去创建一个
Cristopher Moore | David Kempe | Mahyar Salek | C. Moore | D. Kempe | Mahyar Salek | Cristopher Moore
[1] E. H. Clarke. Multipart pricing of public goods , 1971 .
[2] Sven de Vries,et al. Linear Programming and Vickrey Auctions , 2001 .
[3] Edith Elkind,et al. Frugality ratios and improved truthful mechanisms for vertex cover , 2006, EC '07.
[4] Theodore Groves,et al. Incentives in Teams , 1973 .
[5] Ron Lavi,et al. Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.
[6] Christos H. Papadimitriou,et al. On the Hardness of Being Truthful , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[7] Vijay Kumar,et al. Coalitional games on graphs: core structure, substitutes and frugality , 2003, EC '03.
[8] Ning Chen,et al. Cheap labor can be expensive , 2007, SODA '07.
[9] Christos H. Papadimitriou,et al. Algorithms, Games, and the Internet , 2001, ICALP.
[10] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[11] Ning Chen,et al. Frugal Mechanism Design via Spectral Techniques , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[12] E. Maasland,et al. Auction Theory , 2021, Springer Texts in Business and Economics.
[13] Nicole Immorlica,et al. First-price path auctions , 2005, EC '05.
[14] Qiqi Yan. On the Price of Truthfulness in Path Auctions , 2007, WINE.
[15] Uriel Feige,et al. Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).
[16] Makoto Yokoo,et al. False-Name-Proof Mechanisms for Hiring a Team , 2007, WINE.
[17] Anna R. Karlin,et al. Auctions for structured procurement , 2008, SODA '08.
[18] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[19] Kenneth Steiglitz,et al. Frugality in path auctions , 2004, SODA '04.
[20] Jason D. Hartline,et al. Knapsack auctions , 2006, SODA '06.
[21] Kunal Talwar,et al. The Price of Truth: Frugality in Truthful Mechanisms , 2003, STACS.
[22] Anna R. Karlin,et al. Beyond VCG: frugality of truthful mechanisms , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[23] Ravindra K. Ahuja,et al. Network Flows , 2011 .
[24] Carsten Lund,et al. On the hardness of approximating minimization problems , 1993, STOC.
[25] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[26] William J. Cook,et al. Combinatorial optimization , 1997 .
[27] P. Klemperer. Auction Theory: A Guide to the Literature , 1999 .
[28] Éva Tardos,et al. Frugal path mechanisms , 2002, SODA '02.
[29] Yaoyun Shi,et al. Path Auctions When an Agent Can Own Multiple Edges , 2007 .