On maximizing welfare when utility functions are subadditive

SIAM Journal on Computing

Volumn 39, Issue 1, 2009, Pages 122-142

  Feige, Uriel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Approximation algorithms; Combinatorial auctions; Linear programming; Randomized rounding

Indexed keywords

APPROXIMATION RATIOS; BALTIMORE; COMBINATORIAL AUCTIONS; DISCRETE ALGORITHMS; FEASIBLE SOLUTION; FRACTIONAL SOLUTIONS; LINEAR PROGRAMMING RELAXATION; LINEAR PROGRAMS; NEW YORK; PHILADELPHIA; RANDOMIZED ROUNDING; UTILITY FUNCTIONS;

COMBINATORIAL MATHEMATICS; COMMERCE; COMPUTATION THEORY; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 67650118854     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070680977     Document Type: Conference Paper

References (9)

1. S. ARORA AND S. SAFRA, Probabilistic Checking of Proofs: A New Characterization of NP, J. ACM, 45 (1998), pp. 70-122.
2. O. N. BONDAREVA, Some applications of linear programming to cooperative games, Problemy Kibernet., 10 (1963), pp. 119-139.
3. S. DOBZINSKI, N. NISAN, AND M. SCHAPIRA, Approximation algorithms for combinatorial auctions with complement-free bidders, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (Baltimore, MD), ACM, New York, 2005, pp. 610-618.
4. S. DOBZINSKI AND M. SCHAPIRA, An improved approximation algorithm for combinatorial auctions with submodular bidders, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (Miami, FL), SIAM, Philadelphia, 2006, pp. 1064-1073.
5. U. FEIGE, On maximizing welfare when utility functions are subadditive, Preliminary version of the current paper, appeared in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (Seattle, WA), ACM, New York, 2006, pp. 41-50.
6. U. FEIGE AND J. VONDRAK, Approximation algorithms for allocation problems: Improving the factor of 1-1/e, in Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (Berkeley, CA), IEEE, Piscataway, NJ, 2006, pp. 667-676.
7. L. FLEISCHER, M. GOEMANS, V. MIRROKNI, AND M. SVIRIDENKO, Tight approximation algorithms for maximum general assignment problems, in Proceedings of 17th the Annual ACM-SIAM Symposium on Discrete Algorithms (Miami, FL), SIAM, Philadelphia, 2006, pp. 611-620.
8. B. LEHMANN, D. LEHMANN, AND N. NISAN, Combinatorial auctions with decreasing marginal utilities, in Proceedings of the 3rd ACM Conference on Electronic Commerce (Tampa, FL), ACM, New York, 2001, pp. 18-28.
9. L. S. SHAPLEY, On balanced sets and cores, Naval Res. Logist. Quart., 14 (1967), pp. 453-460.