Truthful unification framework for packing integer programs with choices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 833-844

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

^a MICROSOFT RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; LINEAR PROGRAMMING; LINGUISTICS; MACHINE DESIGN; MECHANISMS; NUCLEAR PROPULSION; TRANSLATION (LANGUAGES); TREES (MATHEMATICS);

ALGORITHMIC MECHANISM DESIGN; ALGORITHMIC TECHNIQUES; ALTERNATIVE METHODS; BAND-WIDTH ALLOCATION; BIPARTITE GRAPHS; BUILDING BLOCKS; COMBINATORIAL OP-TIMIZATION PROBLEM; INTEGER LINEAR PROGRAMS; INTEGER PROGRAMS; MONOTONICITY PROPERTIES; MULTIPLE KNAPSACK PROBLEM; NON-TRIVIAL; NP-HARD PROBLEMS; PACKING INTEGER PROGRAMS; RESEARCH DIRECTIONS; TREE NETWORKS; TRUTHFUL MECHANISMS;

INTEGER PROGRAMMING;

EID: 49049120329     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_68     Document Type: Conference Paper

References (32)

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. In: The weighted bipartite mataching problem, ch. 12, Prentice Hall, Englewood Cliffs (1993)
2. Archer, A., Papadimitriou, C.H., Talwar, K., Tardos, É.: An approximate truthful mechanism for combinatorial auctions with single parameter agents. In: 14th SODA, pp. 205-214 (2003)
3. Awerbuch, B., Azar, Y., Fiat, A., Leonardi, S., Rosén, A.: On-line competitive algorithms for call admission in optical networks. Algorithmica 31(1), 29-43 (2001)
4. Azar, Y., Gamzu, I., Gutner, S.: Truthful unsplittable flow for large capacity networks. In: 19th SPAA, pp. 320-329 (2007)
5. Babaioff, M., Lavi, R., Pavlov, E.: Single-value combinatorial auctions and implementation in undominated strategies. In: 17th SODA, pp. 1054-1063 (2006)
6. Bansal, N., Chakrabarti, A., Epstein, A., Schieber, B.: A quasi-ptas for unsplittable flow on line graphs. In: 38th STOC, pp. 721-729 (2006)
7. Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM 48(5), 1069-1090 (2001)
8. Bar-Yehuda, R., Beder, M., Cohen, Y., Rawitz, D.: Resource allocation in bounded degree trees. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 64-75. Springer, Heidelberg (2006)
9. Briest, P., Krysta, P., Vöcking, B.: Approximation techniques for utilitarian mechanism design. In: 37th STOC, pp. 39-48 (2005)
10. Calinescu, G., Chakrabarti, A., Karloff, H.J., Rabani, Y.: Improved approximation algorithms for resource allocation. In: 9th IPCO, pp. 439-456 (2001)
11. Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. In: 5th APPROX, pp. 51-66 (2002)
12. Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SICOMP 35(3), 713-728 (2005)
13. Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity demand flow in a tree. In: 30th ICALP, pp. 410-425 (2003)
14. Clarke, E.H.: Multipart pricing of public goods. Public Choice 8, 17-33 (1971)
15. Dawande, M., Kalagnanam, J., Keskinocak, P., Salman, F.S., Ravi, R.: Approximation algorithms for the multiple knapsack problem with assignment restrictions. Journal of Combinatorial Optimization 4(2), 171-186 (2000)
16. Feige, U., Vondrák, J.: Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. In: 47th FOCS, pp. 667-676 (2006)
17. Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: 17th SODA, pp. 611-620 (2006)
18. Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3-20 (1997)
19. Groves, T.: Incentives in teams. Econemetrica 41(4), 617-631 (1973)
20. Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. In: 46th FOCS, pp. 595-604 (2005)
21. Lehmann, D.J., O'Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. J. ACM 49(5), 577-602 (2002)
22. Lewin-Eytan, L., Naor, J., Orda, A.: Admission control in networks with advance reservations. Algorithmica 40(4), 293-304 (2004)
23. Mu'alem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions. In: 18th AAAI, pp. 379-384 (2002)
24. Nisan, N., Ronen, A.: Computationally feasible vcg mechanisms. In: 2nd EC, pp. 242-252 (2000)
25. Nisan, N., Ronen, A.: Algorithmic mechanism design. GEB 35, 166-196 (2001)
26. Nutov, Z., Beniaminy, I., Yuster, R.: A (1-1/e)-approximation algorithm for the generalized assignment problem. ORL 34(3), 283-288 (2006)
27. Phillips, C.A., Uma, R.N., Wein, J.: Off-line admission control for general scheduling problems. In: 11th SODA, pp. 879-888 (2000)
28. Raghavan, P.: Probabilistic construction of deterministic algorithms: Approximating packing integer programs. JCSS 37(2), 130-143 (1988)
29. Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365-374 (1987)
30. Srinivasan, A.: Improved approximation guarantees for packing and covering integer programs. SICOMP 29(2), 648-670 (1999)
31. Tarjan, R.E.: Decomposition by clique separators. DM 55(2), 221-232 (1985)
32. Vickery, W.: Counterspeculation, auctions and competitive sealed tender. Journal of Finance 16, 8-37 (1961)