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 条
  • [1] On the Approximability of the Stable Matching Problem with Ties of Size Two
    Robert Chiang
    Kanstantsin Pashkovich
    Algorithmica, 2020, 82 : 2668 - 2686
  • [2] Approximability results for stable marriage problems with ties
    Halldórsson, MM
    Irving, RW
    Iwama, K
    Manlove, DF
    Miyazaki, S
    Morita, Y
    Scott, S
    THEORETICAL COMPUTER SCIENCE, 2003, 306 (1-3) : 431 - 447
  • [3] On the approximability of the maximum induced matching problem
    Duckworth, William
    Manlove, David F.
    Zito, Michele
    JOURNAL OF DISCRETE ALGORITHMS, 2005, 3 (01) : 79 - 91
  • [4] The stable roommates problem with ties
    Irving, RW
    Manlove, DF
    JOURNAL OF ALGORITHMS, 2002, 43 (01) : 85 - 105
  • [5] Approximability of the minimum maximal matching problem in planar graphs
    Nagamochi, H
    Nishida, Y
    Ibaraki, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (12): : 3251 - 3258
  • [6] Improved approximation algorithms for two variants of the stable marriage problem with ties
    Huang, Chien-Chung
    Kavitha, Telikepalli
    MATHEMATICAL PROGRAMMING, 2015, 154 (1-2) : 353 - 380
  • [7] Improved approximation algorithms for two variants of the stable marriage problem with ties
    Chien-Chung Huang
    Telikepalli Kavitha
    Mathematical Programming, 2015, 154 : 353 - 380
  • [8] Multi-Objective Stable Matching with Ties
    Phuke, Nitin
    Gharote, Mangesh
    Patil, Rahul
    Lodha, Sachin
    2017 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2017, : 964 - 968
  • [9] On the approximability of the two-phase knapsack problem
    Nip, Kameng
    Wang, Zhenbo
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (04) : 1155 - 1179
  • [10] On the approximability of the two-phase knapsack problem
    Kameng Nip
    Zhenbo Wang
    Journal of Combinatorial Optimization, 2019, 38 : 1155 - 1179
12345