Truthful unsplittable flow for large capacity networks

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2007, Pages 320-329

  Azar, Yossi ^a,b   Gamzu, Iftah ^b   Gutner, Shai ^b  

^a MICROSOFT RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Combinatorial and multi unit auctions; Mechanism design; Primal dual method

Indexed keywords

COMBINATORIAL AND MULTI-UNIT AUCTIONS; LARGE CAPACITY NETWORKS; MECHANISM DESIGN; PRIMAL-DUAL METHOD; UNSPLITTABLE FLOW;

APPROXIMATION ALGORITHMS; GAME THEORY; GRAPH THEORY; LINEAR SYSTEMS; MULTI AGENT SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

DATA FLOW ANALYSIS;

EID: 35248838819     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1248377.1248432     Document Type: Conference Paper

References (18)

1. M. Andrews, J. Chuzhoy, S. Khanna, and L. Zhang. Hardness of the undirected edge-disjoint paths problem with congestion. In Proceedings 46th Annual IEEE Symposium on Foundations of Computer Science, pages 226-244, 2005.
2. A. Archer, C. H. Papadimitriou, K. Talwar, and E. Tardos. An approximate truthful mechanism for combinatorial auctions with single para-meter agents. In Proceedings 14th annual ACM-SIAM Symposium on Discrete Algorithms, pages 205-214, 2003.
3. A. Archer and É. Tardos. Frugal path mechanisms. In Proceedings 13th annual ACM-SIAM Symposium on Discrete Algorithms, pages 991-999, 2002.
4. B. Awerbuch, Y. Azar, and A. Meyerson. Reducing truth-telling online mechanisms to online optimization. In Proceedings 35th Annual ACM Symposium on Theory of Computing, pages 503-510, 2003.
5. Y. Azar and O. Regev. Combinatorial algorithms for the unsplittable flow problem. Algorithmica, 44(1):49--66, 2006.
6. Y. Bartal, R. Gonen, and N. Nisan. Incentive compatible multi unit combinatorial auctions. In Proceedings 9th Conference on Theoretical Aspects of Rationality and Knowledge, pages 72-87, 2003.
7. P. Briest, P. Krysta, and B. Vöcking. Approximation techniques for utilitarian mechanism design. In Proceedings 37th ACM Symposium on Theory of Computing, pages 39-48, 2005.
8. L. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. In Proceedings 40th Annual IEEE Symposium on Foundations of Computer Science, pages 24-31, 1999.
9. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings 39th Annual IEEE Symposium on Foundations of Computer Science, pages 300-309, 1998.
10. V. Guruswami, S. Khanna, R. Rajaraman, F. B. Shepherd, and M. Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In Proceedings 31th annual ACM symposium on Theory of Computing, pages 19-28, 1999.
11. V. Guruswami and K. Talwar. Hardness of low congestion routing in directed graphs. Electronic Colloquium on Computational Complexity (ECCC) Technical Report, TR06-141, 2006.
12. R. Lavl and C. Swamy. Truthful and near-optimal mechanism design via linear programming. In Proceedings 46th Annual IEEE Symposium on Foundations of Computer Science, pages 595-604, 2005.
13. D. J. Lehmann, L. O'Callaghan, and Y. Shoham. Truth revelation in approximately efficient combinatorial auctions. Journal of the ACM, 49(5):577-602, 2002.
14. A. Mu'alem and N. Nisan. Truthful approximation mechanisms for restricted combinatorial auctions. In Proceedings 18th National Conference on Artificial Intelligence, pages 379-384, 2002.
15. N. Nisan and A. Ronen. Algorithmic mechanism design. In Proceedings 31th ACM Symposium on Theory of Computing, pages 129-140, 1999.
16. P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 37(2):130-143, 1988.
17. P. Raghavan and C. D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365-374, 1987.
18. A. Srinivasan. Improved approximation guarantees for packing and covering integer programs. SIAM Journal on Computing, 29(2):648-670, 1999.