Optimal collective dichotomous choice under partial order constraints

Ruth Ben-Yashar; Samir Khuller; Sarit Kraus

doi:10.1016/S0165-4896(00)00069-X

Optimal collective dichotomous choice under partial order constraints

Ruth Ben-Yashar, Samir Khuller, Sarit Kraus

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

This paper generalizes optimal collective dichotomous choices by including constraints which limit combinations of acceptance and rejection decisions for m projects under consideration. Two types of constraints are examined. The first type occurs when acceptance of some projects requires acceptance of others. This type reduces the choice problem to the tractable (solvable in polynomial time) problem of finding a maximum weight closed subset of a directed acyclic graph. The second type occurs when some projects must be accepted when certain others are rejected. We show that this type renders the choice problem to be NP-complete by reduction from the problem of Vertex Cover. Applicability of the generalization to information filtering is discussed.

Original language	English
Pages (from-to)	349-364
Number of pages	16
Journal	Mathematical Social Sciences
Volume	41
Issue number	3
DOIs	https://doi.org/10.1016/S0165-4896(00)00069-X
State	Published - May 2001

Bibliographical note

Funding Information:
Research was partially supported by NSF CAREER Award, CCR-9501355, NSF IIS9907482 and by the Schinter Foundation for Research on the Israeli Economy and Society. The authors thank the referees for providing detailed suggestions and comments.

Keywords

Constraints
D70
D81
Information filtering
Optimal collective dichotomous choice

Access to Document

10.1016/S0165-4896(00)00069-X

Cite this

@article{d510411920f64ea4891596f2cbe0e700,

title = "Optimal collective dichotomous choice under partial order constraints",

abstract = "This paper generalizes optimal collective dichotomous choices by including constraints which limit combinations of acceptance and rejection decisions for m projects under consideration. Two types of constraints are examined. The first type occurs when acceptance of some projects requires acceptance of others. This type reduces the choice problem to the tractable (solvable in polynomial time) problem of finding a maximum weight closed subset of a directed acyclic graph. The second type occurs when some projects must be accepted when certain others are rejected. We show that this type renders the choice problem to be NP-complete by reduction from the problem of Vertex Cover. Applicability of the generalization to information filtering is discussed.",

keywords = "Constraints, D70, D81, Information filtering, Optimal collective dichotomous choice",

author = "Ruth Ben-Yashar and Samir Khuller and Sarit Kraus",

note = "Funding Information: Research was partially supported by NSF CAREER Award, CCR-9501355, NSF IIS9907482 and by the Schinter Foundation for Research on the Israeli Economy and Society. The authors thank the referees for providing detailed suggestions and comments. ",

year = "2001",

month = may,

doi = "10.1016/S0165-4896(00)00069-X",

language = "אנגלית",

volume = "41",

pages = "349--364",

journal = "Mathematical Social Sciences",

issn = "0165-4896",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Optimal collective dichotomous choice under partial order constraints

AU - Ben-Yashar, Ruth

AU - Khuller, Samir

AU - Kraus, Sarit

N1 - Funding Information: Research was partially supported by NSF CAREER Award, CCR-9501355, NSF IIS9907482 and by the Schinter Foundation for Research on the Israeli Economy and Society. The authors thank the referees for providing detailed suggestions and comments.

PY - 2001/5

Y1 - 2001/5

N2 - This paper generalizes optimal collective dichotomous choices by including constraints which limit combinations of acceptance and rejection decisions for m projects under consideration. Two types of constraints are examined. The first type occurs when acceptance of some projects requires acceptance of others. This type reduces the choice problem to the tractable (solvable in polynomial time) problem of finding a maximum weight closed subset of a directed acyclic graph. The second type occurs when some projects must be accepted when certain others are rejected. We show that this type renders the choice problem to be NP-complete by reduction from the problem of Vertex Cover. Applicability of the generalization to information filtering is discussed.

AB - This paper generalizes optimal collective dichotomous choices by including constraints which limit combinations of acceptance and rejection decisions for m projects under consideration. Two types of constraints are examined. The first type occurs when acceptance of some projects requires acceptance of others. This type reduces the choice problem to the tractable (solvable in polynomial time) problem of finding a maximum weight closed subset of a directed acyclic graph. The second type occurs when some projects must be accepted when certain others are rejected. We show that this type renders the choice problem to be NP-complete by reduction from the problem of Vertex Cover. Applicability of the generalization to information filtering is discussed.

KW - Constraints

KW - D70

KW - D81

KW - Information filtering

KW - Optimal collective dichotomous choice

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

U2 - 10.1016/S0165-4896(00)00069-X

DO - 10.1016/S0165-4896(00)00069-X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0041365673

SN - 0165-4896

VL - 41

SP - 349

EP - 364

JO - Mathematical Social Sciences

JF - Mathematical Social Sciences

IS - 3

ER -

Optimal collective dichotomous choice under partial order constraints

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this