TY - GEN

T1 - Inapproximability of combinatorial public projects

AU - Schapira, Michael

AU - Singer, Yaron

PY - 2008

Y1 - 2008

N2 - We study the Combinatorial Public Project Problem (CPPP) in which n agents are assigned a subset of m resources of size k so as to maximize the social welfare. Combinatorial public projects are an abstraction of many resource-assignment problems (Internet-related network design, elections, etc.). It is known that if all agents have submodular valuations then a constant approximation is achievable in polynomial time. However, submodularity is a strong assumption that does not always hold in practice. We show that (unlike similar problems such as combinatorial auctions) even slight relaxations of the submodularity assumption result in non-constant lower bounds for approximation.

AB - We study the Combinatorial Public Project Problem (CPPP) in which n agents are assigned a subset of m resources of size k so as to maximize the social welfare. Combinatorial public projects are an abstraction of many resource-assignment problems (Internet-related network design, elections, etc.). It is known that if all agents have submodular valuations then a constant approximation is achievable in polynomial time. However, submodularity is a strong assumption that does not always hold in practice. We show that (unlike similar problems such as combinatorial auctions) even slight relaxations of the submodularity assumption result in non-constant lower bounds for approximation.

UR - http://www.scopus.com/inward/record.url?scp=58949098032&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-92185-1_41

DO - 10.1007/978-3-540-92185-1_41

M3 - Conference contribution

AN - SCOPUS:58949098032

SN - 3540921842

SN - 9783540921844

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

SP - 351

EP - 361

BT - Internet and Network Economics - 4th International Workshop, WINE 2008, Proceedings

T2 - 4th International Workshop on Internet and Network Economics, WINE 2008

Y2 - 17 December 2008 through 20 December 2008

ER -