On the Approximability of the Stable Matching Problem with Ties of Size Two

被引：1

作者：

Chiang, Robert ^{[1
]}

Pashkovich, Kanstantsin ^{[2
]}

机构：

[1] Univ Waterloo, Dept Combinator & Optimizat, 200 Univ Ave West, Waterloo, ON N2L 3G1, Canada

[2] Univ Ottawa, Sch Comp Sci & Elect Engn, 800 King Edward Ave, Ottawa, ON K1N 6N5, Canada

来源：

ALGORITHMICA | 2020年 / 82卷 / 09期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Stable matchings; Ties; Maximum cardinality; Approximation algorithm; VARIANTS;

D O I：

10.1007/s00453-020-00703-9

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The stable matching problem is one of the central problems of algorithmic game theory. If participants are allowed to have ties, the problem of finding a stable matching of maximum cardinality is an NP-hard problem, even when the ties are of size two. Moreover, in this setting it is UGC-hard to provide an approximation with a constant factor smaller than 4/3. In this paper, we give a tight analysis of an approximation algorithm given by Huang and Kavitha for the maximum cardinality stable matching problem with ties of size two, demonstrating an improved 4/3-approximation factor.

引用

页码：2668 / 2686

页数：19

共 50 条

[41] On the approximability of the Steiner tree problem
Thimm, M
THEORETICAL COMPUTER SCIENCE, 2003, 295 (1-3) : 387 - 402
[42] The approximability of the string barcoding problem
Lancia, Giuseppe
Rizzi, Romeo
ALGORITHMS FOR MOLECULAR BIOLOGY, 2006, 1 (1)
[43] Rotations in the stable b-matching problem
Borbel'ova, Viera
Cechlarova, Katarina
THEORETICAL COMPUTER SCIENCE, 2010, 411 (16-18) : 1750 - 1762
[44] ON THE STABLE EXACT MODEL-MATCHING PROBLEM
VARDULAKIS, AIG
KARCANIAS, N
SYSTEMS & CONTROL LETTERS, 1985, 5 (04) : 237 - 242
[45] MS-MACHIAVELLI AND THE STABLE MATCHING PROBLEM
GALE, D
SOTOMAYOR, M
AMERICAN MATHEMATICAL MONTHLY, 1985, 92 (04): : 261 - 268
[46] On the stable b-matching problem in multigraphs
Borbel'ova, Viera
Cechlarova, Katarina
DISCRETE APPLIED MATHEMATICS, 2008, 156 (05) : 673 - 684
[47] A New Approach to the Pareto Stable Matching Problem
Kamiyama, Naoyuki
MATHEMATICS OF OPERATIONS RESEARCH, 2014, 39 (03) : 851 - 862
[48] Research on stable matching problem of electronic broker
Zhang, Zhenhua
Jia, Shujuan
Sun, Jing
Qu, Yanguo
Wang, Dingwei
Sixth Wuhan International Conference on E-Business, Vols 1-4: MANAGEMENT CHALLENGES IN A GLOBAL WORLD, 2007, : 1125 - 1130
[49] The approximability of the String Barcoding problem
Giuseppe Lancia
Romeo Rizzi
Algorithms for Molecular Biology, 1
[50] The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
Li, Yanjia
Spirkl, Sophie
DISCRETE MATHEMATICS, 2023, 346 (04)

← 1 2 3 4 5 →