Brief Announcement: Time Efficient Self-stabilizing Stable Marriage

2018 ◽  
pp. 387-392
Author(s):  
Joffroy Beauquier ◽  
Thibault Bernard ◽  
Janna Burman ◽  
Shay Kutten ◽  
Marie Laveau
Keyword(s):  
Stable Marriage

Stable Marriage Algorithm for Tracking Intracellular Objects

2013 ◽  
Author(s):  
Ayumi Hamano ◽  
Kensho Fujisaki ◽  
Seiichi Uchida ◽  
Osamu Shiku
Keyword(s):  
Stable Marriage

Stable Marriage with Ties and Incomplete Lists

2008 ◽  
pp. 883-885 ◽  
Author(s):  
Kazuo Iwama ◽  
Shuichi Miyazaki
Keyword(s):  
Stable Marriage ◽  
Incomplete Lists

scholarly journals Adapting Stable Matchings to Evolving Preferences

2020 ◽  
Vol 34 (02) ◽  
pp. 1830-1837 ◽  
Author(s):  
Robert Bredereck ◽  
Jiehua Chen ◽  
Dušan Knop ◽  
Junjie Luo ◽  
Rolf Niedermeier
Keyword(s):  
Computational Complexity ◽  
Computational Cost ◽  
Modern Society ◽  
Stable Matching ◽  
Stable Marriage ◽  
Fixed Parameter Tractability ◽  
Stable Matchings ◽  
Changing Environments ◽  
Fixed Parameter ◽  
Comprehensive Picture

Adaptivity to changing environments and constraints is key to success in modern society. We address this by proposing “incrementalized versions” of Stable Marriage and Stable Roommates. That is, we try to answer the following question: for both problems, what is the computational cost of adapting an existing stable matching after some of the preferences of the agents have changed. While doing so, we also model the constraint that the new stable matching shall be not too different from the old one. After formalizing these incremental versions, we provide a fairly comprehensive picture of the computational complexity landscape of Incremental Stable Marriage and Incremental Stable Roommates. To this end, we exploit the parameters “degree of change” both in the input (difference between old and new preference profile) and in the output (difference between old and new stable matching). We obtain both hardness and tractability results, in particular showing a fixed-parameter tractability result with respect to the parameter “distance between old and new stable matching”.

An efficient algorithm for the “optimal” stable marriage

1987 ◽  
Vol 34 (3) ◽  
pp. 532-543 ◽  
Author(s):  
Robert W. Irving ◽  
Paul Leather ◽  
Dan Gusfield
Keyword(s):  
Efficient Algorithm ◽  
Stable Marriage

scholarly journals Approximation algorithms for the sex-equal stable marriage problem

2010 ◽  
Vol 7 (1) ◽  
pp. 1-17 ◽  
Author(s):  
Kazuo Iwama ◽  
Shuichi Miyazaki ◽  
Hiroki Yanagisawa
Keyword(s):  
Approximation Algorithms ◽  
Stable Marriage ◽  
Stable Marriage Problem ◽  
Marriage Problem
Sign in / Sign up

Export Citation Format

Share Document