Dynamic Matching Markets and Voting Paths

DOI10.1007/11785293_9zbMath1142.91690OpenAlexW1530317181MaRDI QIDQ5757906

Telikepalli Kavitha, David J. Abraham

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

Mathematics Subject Classification ID

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

Related Items (7)

Popular Matchings: Structure and Algorithms ⋮ The Generalized Popular Condensation Problem ⋮ Dynamic rank-maximal and popular matchings ⋮ Popular matchings: structure and algorithms ⋮ Popular matchings in the weighted capacitated house allocation problem ⋮ Unpopularity factor in the marriage and roommates problems ⋮ Weighted popular matchings

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