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 条
  • [31] (In)approximability Results for Pattern Matching Problems
    Clifford, Raphael
    Popa, Alexandru
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2010, 2010, : 52 - 62
  • [32] A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences
    Lerner, Eduard
    DISCRETE APPLIED MATHEMATICS, 2023, 333 : 1 - 12
  • [33] Approximability of the minimum-weight k-size cycle cover problem
    Khachay, Michael
    Neznakhina, Katherine
    JOURNAL OF GLOBAL OPTIMIZATION, 2016, 66 (01) : 65 - 82
  • [34] An empirical study of the stable marriage problem with ties and incomplete lists
    Gent, IP
    Prosser, P
    ECAI 2002: 15TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2002, 77 : 141 - 145
  • [35] Approximability of the minimum-weight k-size cycle cover problem
    Michael Khachay
    Katherine Neznakhina
    Journal of Global Optimization, 2016, 66 : 65 - 82
  • [36] On the approximability of the link building problem
    Olsen, Martin
    Viglas, Anastasios
    THEORETICAL COMPUTER SCIENCE, 2014, 518 : 96 - 116
  • [37] On The Approximability Of The Traveling Salesman Problem
    Christos H. Papadimitriou*
    Santosh Vempala†
    Combinatorica, 2006, 26 : 101 - 120
  • [38] On the approximability of the Steiner tree problem
    Thimm, M
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 678 - 689
  • [39] On the approximability of the traveling salesman problem
    Papadimitriou, CH
    Vempala, S
    COMBINATORICA, 2006, 26 (01) : 101 - 120
  • [40] Complexity and Approximability of the Marking Problem
    Valizadeh, M.
    Tadayon, M. H.
    JOURNAL OF MATHEMATICAL EXTENSION, 2021, 15 (01) : 41 - 60
12345