Selected open problems in matching under preferences

zbMATH Open1428.68170MaRDI QIDQ5207883FDOQ5207883

Authors: Katarina Cechlárová, Ágnes Cseh, David F. Manlove 

Publication date: 13 January 2020

Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/586/595

Recommendations

• Three-Dimensional Stabl Matching Problems
• Matching under preferences
• Three-sided stable matching problem with independent preferences
• Editorial: Special issue on matching under preferences
• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Discrete location and assignment (90B80) Matching models (91B68)

Cited In (3)

• Microthesis: The student-project allocation problem
• Special issue: Selected papers based on the presentations at the workshop ``Match-UP: Matching under preferences -- algorithms and complexity, Reykjavík, Iceand, July 2008
• A solution to matching with preferences over colleagues

This page was built for publication: Selected open problems in matching under preferences

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