A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Distributed Stable Matching Problems with Ties and Incomplete Lists
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
We consider the Stable Marriage Problem and the Stable Roommates Problem, two types of the general class of Stable Matching Problems, in presence of ties and incomplete preference lists. ...
This motivates a distributed formulation of these problems to keep privacy. We propose a distributed constraint approach that solves all the considered problems, keeping privacy. ...
A solution is a stable matching. Similarly, we define here the distributed versions with incomplete lists (DisSMI ), with ties (DisSMT ) and with ties and incomplete lists (DisSMTI ) 1 . ...
doi:10.1007/11889205_49
fatcat:cqqphqgtlzenpgtnw37fujsrqy
Local Search Approaches in Stable Matching Problems
2013
Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
marriage problems with ties and incomplete 88 lists. ...
: local search, stable matching, sampling, ties and incomplete preference lists achieve a certain type of "stability". ...
This 585 work has been partially supported by the MIUR PRIN 20089M932N project "Innovative and multi-586 disciplinary approaches for constraint and preference reasoning". ...
doi:10.3390/a6040591
fatcat:ixd7vpr7i5cd5nsi2cncshsgum
A Survey of the Stable Marriage Problem and Its Variants
2008
International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The stable marriage problem is to find a matching between men and women, considering preference lists in which each person expresses his/her preference over the members of the opposite gender. ...
This paper introduces old and recent results on the stable marriage problem and some other related problems. ...
Incomplete Preference Lists with Ties This extension allows both incompleteness and ties in preference lists. We call this extension SMTI (SM with Ties and Incomplete lists). ...
doi:10.1109/icks.2008.7
fatcat:6ri6rnqmkza5piry3jcdd43ekq
Local search for stable marriage problems
[article]
2010
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We consider both the classical stable marriage problem and one of its useful variations (denoted SMTI) where the men and women express their preferences in the form of an incomplete preference list with ...
Matchings are permitted only with people who appear in these lists, an we try to find a stable matching that marries as many people as possible. ...
We also provided an algorithm for SMTI problems which is both fast and effective at finding large stable marriages for problems of sizes not considered before in the literature. ...
arXiv:1007.0859v1
fatcat:cgch36eeifhu7ohxglrf72hw3q
Hospitals/Residents Problem
[chapter]
2016
Encyclopedia of Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
with Ties and Incomplete Lists" for further details). ...
Several approximation algorithms for finding a maximum cardinality weakly stable matching have been formulated (see "Stable Marriage with Ties and Incomplete Lists" and [12, Section 3.2.6] for further ...
doi:10.1007/978-1-4939-2864-4_180
fatcat:hhi4fhetnfao7hqiued33ki3xa
Hospitals/Residents Problem
[chapter]
2008
Encyclopedia of Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
with Ties and Incomplete Lists" for further details). ...
Several approximation algorithms for finding a maximum cardinality weakly stable matching have been formulated (see "Stable Marriage with Ties and Incomplete Lists" and [12, Section 3.2.6] for further ...
doi:10.1007/978-0-387-30162-4_180
fatcat:jlxbgshvmjambdw3y4xliog3hy
The Hospitals/Residents Problem
[chapter]
2015
Encyclopedia of Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
with Ties and Incomplete Lists" for further details). ...
Several approximation algorithms for finding a maximum cardinality weakly stable matching have been formulated (see "Stable Marriage with Ties and Incomplete Lists" and [12, Section 3.2.6] for further ...
doi:10.1007/978-3-642-27848-8_180-2
fatcat:srbueizr6zdivo5kmtfccwfevi
Stable Matching with Uncertain Linear Preferences
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We also examine more restricted problems such as deciding whether a certainly stable matching exists. ...
For each of the models, we study the computational complexity of computing the stability probability of a given matching as well as finding a matching with the highest probability of being stable. ...
SMP with Incomplete lists (SMPI) and SMT with Incomplete lists (SMTI) captures these scenarios where each agent's partially ordered list contains only his/her acceptable candidates. ...
arXiv:1607.02917v1
fatcat:sdz2mmrjzjhg3a5azrcgamk5jq
Abstract argumentation and (optimal) stable marriage problems
2019
Argument & Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we elaborate on the original formulation by Dung, by also encoding SM problems with ties and incomplete preference lists into AAFs. ...
Section 4 shows how incomplete lists of preferences and ties among them can be represented in AAFs. ...
Acknowledgements This work has been supported by the following two projects funded by the authors' Department: Argumentation 360 ("Ricerca di Base" 2017-2019) and "Rappresentazione della Conoscenza e Apprendimento ...
doi:10.3233/aac-190474
fatcat:cltmtieibzdvviqpblt23oizka
Optimally stable matchings for resource allocations
2022
Vietnam Journal of Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In the problem, the resource allocation task will be rewritten as the MAX-SMTI variant (i.e., finding the maximum cardinality stable matching of the stable marriage with ties and incomplete lists). ...
., finding the maximum cardinality stable matching of the hospital-residents with ties) is applied for the second application regarding the virtual machine allocation. ...
This research is funded by the Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 102.01-2017.09. CRediT authorship contribution statement. ...
doi:10.15625/2525-2518/16107
fatcat:ctyno42oz5hp3kby255oqb25uq
Two-Sided Matching with Indifferences: Using Heuristics to Improve Properties of Stable Matchings
2020
Computational Economics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In Two-Sided Matching problems where indifferences are allowed in the preference lists, finding stable matchings with certain properties is known to be NP-hard and, in some instances, even NP-hard to approximate ...
for scenarios with either complete or incomplete preferences. ...
The focus of this evaluation is preferences with indifferences, both in the complete (Stable Matching with Ties, SMT) and incomplete (Stable Matching with Ties and Incompleteness, SMTI) preference setting ...
doi:10.1007/s10614-020-10006-4
fatcat:t2zuumzbbvb2vpn4z5pcubx44q
Hardness of Instance Generation with Optimal Solutions for the Stable Marriage Problem
2021
Journal of Information Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In a variant of the stable marriage problem where ties and incomplete lists are allowed, finding a stable matching of maximum cardinality is known to be NP-hard. ...
In this paper, we investigate the possibility of generating instances with known optimal solutions. ...
Acknowledgments This work was supported by JSPS KAK-ENHI Grant Numbers JP16K00017 and JP20K11677. ...
doi:10.2197/ipsjjip.29.166
fatcat:j4pdws52yneaxcvphcemb4vmxq
Multi-agent Reinforcement Learning for Decentralized Stable Matching
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Along with conventional stable matching case where agents have strictly ordered preferences, we check the applicability of our approach for stable matching with incomplete lists and ties. ...
It is possible that this search for matches starts with no initial knowledge of the environment. ...
The stable matching problem with incomplete preference
lists (SMI) may have incomplete preference lists for those involved. ...
arXiv:2005.01117v3
fatcat:yfjmavxsojcefmnzq2quyunude
Capacity Variation in the Many-to-one Stable Matching
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Finally, we study the variants of these problems when the goal is to maximize the size of the final matching under incomplete preference lists. ...
The many-to-one stable matching problem provides the fundamental abstraction of several real-world matching markets such as school choice and hospital-resident allocation. ...
Acknowledgments This work was funded by the Institut de valorisation des données and Fonds de Recherche du Québec through the FRQ-IVADO Research Chair in Data Science for Combinatorial Game Theory, and ...
arXiv:2205.01302v1
fatcat:6qyq3s4hyjef3fexndoyscxyla
Definition And Core Components Of The Role-Partner Allocation Problem In Collaborative Networks
2018
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
lists both for roles and partners. ...
Thus, an allocation/matching problem arises that will be referred to as Role-Partner Allocation problem. ...
side, and (iv) admits incomplete preference list with ties in both sides; all of which fulfilling restrictions 1 to 7. ...
doi:10.5281/zenodo.1315585
fatcat:kw6t6mo7jjctfdi436t3ny22wi
« Previous
Showing results 1 — 15 out of 41,860 results