Counting houses of Pareto optimal matchings in the house allocation problem

DOI10.1007/978-3-319-07890-8_26zbMATH Open1401.91452OpenAlexW2568960630MaRDI QIDQ5265030FDOQ5265030

Authors: Balázs Keszegh, Tillmann Miltzow, Andrei Asinowski 

Publication date: 21 July 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/15174/1/FUNfinal.pdf

Recommendations

• Counting houses of Pareto optimal matchings in the house allocation problem
• Algorithms and Computation
• Algorithms and Computation
• Set systems related to a house allocation problem
• Size versus truthfulness in the house allocation problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Matching models (91B68)

Cited In (4)

• Counting houses of Pareto optimal matchings in the house allocation problem
• Algorithms and Computation
• Set systems related to a house allocation problem
• Algorithms and Computation

This page was built for publication: Counting houses of Pareto optimal matchings in the house allocation problem

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