The popular assignment problem: when cardinality is more important than popularity

被引：0

作者：

Kavitha, Telikepalli ^{[1
]}

Kiraly, Tamas ^{[2
]}

Matuschke, Jannik ^{[3
]}

Schlotter, Ildiko ^{[4
,5
]}

Schmidt-Kraepelin, Ulrike ^{[6
]}

机构：

[1] Tata Inst Fundamental Res, Mumbai, Maharashtra, India

[2] Eotvos Lorand Univ, Budapest, Hungary

[3] Katholieke Univ Leuven, Res Ctr Operat Management, Leuven, Belgium

[4] Ctr Econ & Reg Studies, Budapest, Hungary

[5] Budapest Univ Technol & Econ, Budapest, Hungary

[6] Tech Univ Berlin, Berlin, Germany

来源：

PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA | 2022年

基金：

匈牙利科学研究基金会;

关键词：

STABLE MARRIAGE; MATCHINGS; STABILITY; SIZE;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider a matching problem in a bipartite graph G = (A boolean OR B, E) where each node in A is an agent having preferences in partial order over her neighbors, while nodes in B are objects with no preferences. The size of our matching is more important than node preferences {thus, we are interested in maximum matchings only. Any pair of maximum matchings in G (equivalently, perfect matchings or assignments) can be compared by holding a head-to-head election between them where agents are voters. The goal is to compute an assignment such that there is no better or \more popular" assignment. This is the popular assignment problem and it generalizes the well-studied popular matching problem (Abraham et al., 2007). Popular assignments need not exist in every input instance. We show a polynomial-time algorithm that decides if the given instance admits one or not, and computes one, if so. In instances with no popular assignment, we consider the problem of finding an almost popular assignment, i.e., an assignment with minimum unpopularity margin. We show an O* (vertical bar E vertical bar(k)) time algorithm for deciding if there exists an assignment with unpopularity margin at most k. We then show that this algorithm is essentially optimal by proving that the problem is NP-complete and W-l[1]-hard with parameter k. We also consider the minimum-cost popular assignment problem when there are edge costs, and show this problem to be NP-hard. This hardness holds even when all edge costs are in {0, 1}g and agents have strict preferences. By contrast, we propose a polynomial-time algorithm to the problem of deciding if there exists a popular assignment with a given set of forced/forbidden edges (this tractability holds even for partially ordered preferences). Our algorithms are combinatorial and based on LP duality. They search for an appropriate witness or dual certificate, and when a certificate cannot be found, we prove that the desired assignment does not exist in G

引用

页码：103 / 123

页数：21

共 50 条

[1] When 'How' is more important than 'What'
Beretta, Matteo
[J]. EUROPEAN JOURNAL OF PAEDIATRIC DENTISTRY, 2022, 23 (02) : 89 - 89
[2] The k-cardinality assignment problem
DellAmico, M
Martello, S
[J]. DISCRETE APPLIED MATHEMATICS, 1997, 76 (1-3) : 103 - 121
[3] What's Important: When the Question Is More Important Than the Answer
Shah, Ronit V. V.
[J]. JOURNAL OF BONE AND JOINT SURGERY-AMERICAN VOLUME, 2023, 105 (13): : 1036 - 1037
[4] Reflux: When Is It More Than a Laundry Problem?
Kornfeld, Benjamin
Wild, Bridget M.
[J]. PEDIATRIC ANNALS, 2020, 49 (08): : E329 - E331
[5] When feeling is more important than seeing in sensorimotor adaptation
van Beers, RJ
Wolpert, DM
Haggard, P
[J]. CURRENT BIOLOGY, 2002, 12 (10) : 834 - 837
[6] WHEN THE LIFE LESSON IS MORE IMPORTANT THAN COURSE CONTENT
Miller, Amy L.
Samples, Jerry W.
[J]. 2012 ASEE ANNUAL CONFERENCE, 2012,
[7] When to wean Infection more important than anaemia or allergy
Wright, Charlotte M.
[J]. BRITISH MEDICAL JOURNAL, 2011, 342
[8] THE PUBLICS PERCEPTION OF A CHEMICALLY RELATED PROBLEM MAY BE MORE IMPORTANT THAN THAN THE PROBLEM ITSELF
SOLSTAD, MA
[J]. ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1981, 181 (MAR): : 51 - CHAS
[9] The Japanese Fighters Are More Skillful than their Chinese Counterparts, or when the Context is more important than the Text
Gutierrez Garcia, Carlos
Perez Gutierrez, Mikel
Acevedo, William
Cheung, Mei
[J]. REVISTA DE ARTES MARCIALES ASIATICAS, 2010, 5 (01): : 41 - 52
[10] The Japanese figthers are more skillful than their Chinese counterparts, or when the context is more important than the text
Gutierrez-Garcia, Carlos
Perez-Gutierrez, Mikel
Acevedo, William
Cheung, Mei
[J]. IDO MOVEMENT FOR CULTURE-JOURNAL OF MARTIAL ARTS ANTHROPOLOGY, 2010, 10 (01): : 24 - 30

← 1 2 3 4 5 →