Popular Matchings: Structure and Strategic Issues

DOI10.1137/130926249zbMath1319.05107OpenAlexW2057149105WikidataQ62045770 ScholiaQ62045770MaRDI QIDQ2935279

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 graphsmatchingspopular matchingspreference listsmanipulative agent

Mathematics Subject Classification ID

Combinatorial optimization (90C27) 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)

Related Items (4)

Strategic issues in college admissions with score-limits ⋮ Rank-maximal matchings -- structure and algorithms ⋮ Minimal envy and popular matchings ⋮ Strategy-proof popular mechanisms

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