An experimental comparison of single-sided preference matching algorithms
Abstract
References
Index Terms
- An experimental comparison of single-sided preference matching algorithms
Recommendations
Rank-maximal matchings – structure and algorithms
AbstractLet G = ( A ∪ P , E ) be a bipartite graph where A denotes a set of applicants, P denotes a set of posts and ranks on the edges denote preferences of the agents over posts. A matching M in G is rank-maximal if it matches the maximum ...
A note on generalized matching preclusion in bipartite graphs
AbstractFor a graph with an even number of vertices, the matching preclusion number is the minimum number of edges whose deletion results in a graph with no perfect matchings. The conditional matching preclusion number, introduced as an ...
Popular matchings: structure and algorithms
An instance of the popular matching problem (POP-M) consists of a set of applicants and a set of posts. Each applicant has a preference list that strictly ranks a subset of the posts. A matching M of applicants to posts is popular if there is no ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Journal of Experimental Algorithmics](/cms/asset/b3199bf0-0d27-4d33-adb9-d4e1dd39a233/default_cover.png)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 322Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in