Dynamic Matching Markets and Voting Paths

DOI10.1007/11785293_9zbMATH Open1142.91690OpenAlexW1530317181MaRDI QIDQ5757906FDOQ5757906

Authors: David J. Abraham, Telikepalli Kavitha 

Publication date: 7 September 2007

Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11785293_9

Recommendations

• Voting paths
• Maintaining Near-Popular Matchings
• Dynamic rank-maximal and popular matchings
• Popular Matchings
• Popular matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Games involving graphs (91A43) Matching models (91B68)

Cited In (9)

• The generalized popular condensation problem
• Voting paths
• Unpopularity factor in the marriage and roommates problems
• Popular Matchings: Structure and Algorithms
• Weighted popular matchings
• Popular matchings: structure and algorithms
• Popular matchings in the weighted capacitated house allocation problem
• Matching through position auctions
• Dynamic rank-maximal and popular matchings

This page was built for publication: Dynamic Matching Markets and Voting Paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757906)