Dynamic rank-maximal and popular matchings

DOI10.1007/s10878-018-0348-9zbMath1420.90061OpenAlexW2892253014WikidataQ129247937 ScholiaQ129247937MaRDI QIDQ2420654

Prajakta Nimbhorkar, V. Arvind Rameshwar

Publication date: 6 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0348-9

zbMATH Keywords

rankpreferencesaugmenting pathpopular matchingrank-maximal matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (2)

Online 2-stage stable matching ⋮ The dynamics of rank-maximal and popular matchings

Cites Work

• Unnamed Item
• Residence exchange wanted: A stable residence exchange problem
• Rank-maximal matchings -- structure and algorithms
• Maintaining a large matching and a small vertex cover
• Rank-maximal matchings
• Maintaining Near-Popular Matchings
• Popular Matchings
• The Impossibility of Bayesian Group Decision Making with Separate Aggregation of Beliefs and Values
• Characterisation of Strongly Stable Matchings
• Capacitated Rank-Maximal Matchings
• Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
• New deterministic approximation algorithms for fully dynamic matching
• Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
• Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
• Algorithms and Computation
• Dynamic Matching Markets and Voting Paths

This page was built for publication: Dynamic rank-maximal and popular matchings