Results 241 to 250 of about 1,725,881 (271)

The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems

International Journal of Game Theory, 2007
This paper studies the dynamics of stable marriage and stable roommates markets. The main tool of this paper is the algorithm of Roth and Vande Vate and its generalization by Tan and Hsueh. Beyond proposing alternative proofs for known results, some of them are generalized to the nonbipartite case. In particular, it is shown that the lastcomer gets his
Péter Biró 0001, Katarína Cechlárová, Tamás Fleiner   +2 more
openaire   +1 more source

Stable matching with couples

ACM Journal of Experimental Algorithmics, 2011
In practical applications, algorithms for the classic version of the hospitals residents problem (the many-one version of the stable marriage problem) may have to be extended to accommodate the needs of couples who wish to be allocated to (geographically) compatible places.
Péter Biró 0001, Robert W. Irving, Ildikó Schlotter   +2 more
openaire   +2 more sources

On the Existence of Stable Roommate Matchings

Games and Economic Behavior, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the set of many-to-one strongly stable fractional matchings

Mathematical Social Sciences, 2021
Jorge Oviedo, Pablo Neme
exaly  

Cycles to compute the full set of many-to-many stable matchings

Mathematical Social Sciences, 2022
Noelia Juarez, Jorge Oviedo, Pablo Neme   +2 more
exaly  

Stable fractional matchings

Artificial Intelligence, 2021
Aris Filos-Ratsikas, Rohit Vaish, Ioannis Caragiannis   +2 more
exaly  

Stable Matching as Transportation

Proceedings of the 25th ACM Conference on Economics and Computation
Federico Echenique, Joseph Root, Fedor Sandomirskiy   +2 more
openaire   +2 more sources

Stable Matchings with Restricted Preferences: Structure and Complexity

ACM Transactions on Economics and Computation, 2022
Will Rosenbaum, Christine Cheng
exaly  

Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings

Operations Research, 2022
Yuri Faenza, Xuan Zhang
exaly  

What Matchings Can Be Stable? The Testable Implications of Matching Theory

Mathematics of Operations Research, 2008
Federico Echenique
exaly