暂无分享,去创建一个
[1] 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).
[2] Aravind Srinivasan,et al. Improved Approximation Guarantees for Packing and Covering Integer Programs , 1999, SIAM J. Comput..
[3] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[4] Lisa Fleischer,et al. Approximating fractional multicommodity flow independent of the number of commodities , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[5] Jochen Könemann,et al. Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[6] Éva Tardos,et al. Frugal path mechanisms , 2002, SODA '02.
[7] Yossi Azar,et al. Combinatorial Algorithms for the Unsplittable Flow Problem , 2005, Algorithmica.
[8] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..
[9] Éva Tardos,et al. An approximate truthful mechanism for combinatorial auctions with single parameter agents , 2003, SODA '03.
[10] Noam Nisan,et al. Incentive compatible multi unit combinatorial auctions , 2003, TARK '03.
[11] Venkatesan Guruswami,et al. Hardness of Low Congestion Routing in Directed Graphs , 2006, Electron. Colloquium Comput. Complex..
[12] Yossi Azar,et al. Reducing truth-telling online mechanisms to online optimization , 2003, STOC '03.
[13] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[14] Noam Nisan,et al. Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract , 2002, AAAI 2002.
[15] Noam Nisan,et al. Truthful approximation mechanisms for restricted combinatorial auctions , 2008, Games Econ. Behav..
[16] Berthold Vöcking,et al. Approximation techniques for utilitarian mechanism design , 2005, STOC '05.
[17] Sanjeev Khanna,et al. Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion , 2005, FOCS.
[18] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[19] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[20] Venkatesan Guruswami,et al. Hardness of routing with congestion in directed graphs , 2007, STOC '07.