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 条
  • [21] Three-sided stable matching problem with two of them as cooperative partners
    Zhong, Liwei
    Bai, Yanqin
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (01) : 286 - 292
  • [22] A network visualization of stable matching in the stable marriage problem
    Morizumi, Yoshihisa
    Hayashi, Tatsuya
    Ishida, Yoshiteru
    ARTIFICIAL LIFE AND ROBOTICS, 2011, 16 (01) : 40 - 43
  • [23] Preference swaps for the stable matching problem
    Eiben, Eduard
    Gutin, Gregory
    Neary, Philip R.
    Rambaud, Clement
    Wahlstrom, Magnus
    Yeo, Anders
    THEORETICAL COMPUTER SCIENCE, 2023, 940 : 222 - 230
  • [24] A MAXIMUM STABLE MATCHING FOR THE ROOMMATES PROBLEM
    TAN, JJM
    BIT, 1990, 30 (04): : 631 - 640
  • [25] A FURTHER NOTE ON THE STABLE MATCHING PROBLEM
    DEMANGE, G
    GALE, D
    SOTOMAYOR, M
    DISCRETE APPLIED MATHEMATICS, 1987, 16 (03) : 217 - 222
  • [26] SOME REMARKS ON THE STABLE MATCHING PROBLEM
    GALE, D
    SOTOMAYOR, M
    DISCRETE APPLIED MATHEMATICS, 1985, 11 (03) : 223 - 232
  • [27] Maximum Stable Matching with One-Sided Ties of Bounded Length
    Lam, Chi-Kit
    Plaxton, C. Gregory
    THEORY OF COMPUTING SYSTEMS, 2022, 66 (03) : 645 - 678
  • [28] Maximum Stable Matching with One-Sided Ties of Bounded Length
    Chi-Kit Lam
    C. Gregory Plaxton
    Theory of Computing Systems, 2022, 66 : 645 - 678
  • [29] Stable Matching with Ties for Cloud-assisted Smart TV Services
    Kim, Gyuyeong
    Lee, Wonjun
    2014 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS (ICCE), 2014, : 560 - 561
  • [30] Maximum Stable Matching with One-Sided Ties of Bounded Length
    Lam, Chi-Kit
    Plaxton, C. Gregory
    ALGORITHMIC GAME THEORY (SAGT 2019), 2019, 11801 : 343 - 356
12345