NC Algorithms for Popular Matchings in One-Sided Preference Systems and Related Problems (original) (raw)
Related papers
New Models for Two Variants of Popular Matching
2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI), 2017
Weighted random popular matchings
Random Structures & Algorithms, 2010
Stable Matchings with Restricted Preferences: Structure and Complexity
Proceedings of the 22nd ACM Conference on Economics and Computation, 2021
Finding large stable matchings
Journal of Experimental Algorithmics, 2009
Popular Critical Matchings in the Many-to-Many Setting
SSRN Electronic Journal
A FRAMEWORK FOR SOLVING HARD VARIANTS OF STABLE MATCHING WITHIN A LIMITED TIME
Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings
ArXiv, 2018
Stable Matching with Uncertain Linear Preferences
Lecture Notes in Computer Science, 2016
Distributed Stable Matching Problems with Ties and Incomplete Lists
Lecture Notes in Computer Science, 2006
The stable marriage problem with master preference lists
Discrete Applied Mathematics, 2008
An algorithm to compute the full set of many-to-many stable matchings
Mathematical Social Sciences, 2004
A One-Sided Many-to-Many Matching Problem
Dynamic Rank-Maximal Matchings
Maximum-Size Envy-free Matchings
2019
How good are Popular Matchings?
2018
Popular Matching with Lower Quotas
2017
Mathematical models for stable matching problems with ties and incomplete lists
European Journal of Operational Research, 2019
Stable marriage with ties and bounded length preference lists
Journal of Discrete Algorithms, 2009
Critical Relaxed Stable Matchings with Two-Sided Ties
arXiv (Cornell University), 2023
Computer Science & Information Technology (CS & IT) Computer Science Conference Proceedings (CSCP)
International Journal of Computer Science & Information Technology (IJCSIT)
Counting Popular Matchings in House Allocation Problems
Lecture Notes in Computer Science, 2014
Cornell University - arXiv, 2021
2010
Journal of Statistical Mechanics: Theory and Experiment, 2005
Distributed Stable Matching Problems
Lecture Notes in Computer Science, 2005
Specialised constraints for stable matching problems
2005
Matching with Restricted Preferences
2009
Algorithms 2013, 6(4), 824-856; doi:10.3390/a6040824, 2013
Dominance invariant one-to-one matching problems
International Journal of Game Theory, 2014
Overlays with preferences: Approximation algorithms for matching with preference lists
Parallel & Distributed Processing (IPDPS), 2010 IEEE International Symposium on , 2010
The Generalized Median Stable Matchings: Finding Them Is Not That Easy
Lecture Notes in Computer Science