Inapproximability of combinatorial public projects

Michael Schapira; Yaron Singer

doi:10.1007/978-3-540-92185-1_41

Inapproximability of combinatorial public projects

Michael Schapira^*, Yaron Singer

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

12 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Internet and Network Economics - 4th International Workshop, WINE 2008, Proceedings
Pages	351-361
Number of pages	11
DOIs	https://doi.org/10.1007/978-3-540-92185-1_41
State	Published - 2008
Event	4th International Workshop on Internet and Network Economics, WINE 2008 - Shanghai, China Duration: 17 Dec 2008 → 20 Dec 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5385 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	4th International Workshop on Internet and Network Economics, WINE 2008
Country/Territory	China
City	Shanghai
Period	17/12/08 → 20/12/08

Access to Document

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

Cite this

Schapira, M., & Singer, Y. (2008). Inapproximability of combinatorial public projects. In Internet and Network Economics - 4th International Workshop, WINE 2008, Proceedings (pp. 351-361). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5385 LNCS). https://doi.org/10.1007/978-3-540-92185-1_41

@inproceedings{76d162cad17a40b89445397eef0009b1,

title = "Inapproximability of combinatorial public projects",

abstract = "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.",

author = "Michael Schapira and Yaron Singer",

year = "2008",

doi = "10.1007/978-3-540-92185-1_41",

language = "אנגלית",

isbn = "3540921842",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "351--361",

booktitle = "Internet and Network Economics - 4th International Workshop, WINE 2008, Proceedings",

note = "4th International Workshop on Internet and Network Economics, WINE 2008 ; Conference date: 17-12-2008 Through 20-12-2008",

}

Schapira, M & Singer, Y 2008, Inapproximability of combinatorial public projects. in Internet and Network Economics - 4th International Workshop, WINE 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5385 LNCS, pp. 351-361, 4th International Workshop on Internet and Network Economics, WINE 2008, Shanghai, China, 17/12/08. https://doi.org/10.1007/978-3-540-92185-1_41

Inapproximability of combinatorial public projects. / Schapira, Michael; Singer, Yaron.
Internet and Network Economics - 4th International Workshop, WINE 2008, Proceedings. 2008. p. 351-361 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5385 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

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 -

Inapproximability of combinatorial public projects

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this