Popular Matchings: Structure and Strategic Issues

DOI10.1137/130926249MaRDI QIDQ2935279zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Meghana Nasre

Publication date 22 December 2014

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/f1692903cb5e2756fb7a0a74b4b80f8766a8897d

zbMATH Keywords

bipartite graphsmanipulative agentmatchingspopular matchingspreference lists

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial optimization (90C27)

Recommendations

• Popular matchings: structure and algorithms
• Popular Matchings: Structure and Algorithms
• Popular Matchings -- structure and cheating strategies
• Understanding popular matchings via stable matchings
• Optimal popular matchings
• The Strategy Structure of Two-Sided Matching Markets
• The dynamics of rank-maximal and popular matchings
• Strategic complementarities and unraveling in matching markets
• Popular matchings in the stable marriage problem

Cited in

(7)

• Strategic issues in college admissions with score-limits
• Strategy-proof popular mechanisms
• Minimal envy and popular matchings
• Popular ranking
• Popular Matchings -- structure and cheating strategies
• Popular Matchings: Structure and Algorithms
• Popular matchings: structure and algorithms

This page was built for publication: Popular Matchings: Structure and Strategic Issues

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