@InProceedings{am_et_al:LIPIcs.SEA.2018.9,
author = {A M, Krishnapriya and Nasre, Meghana and Nimbhorkar, Prajakta and Rawat, Amit},
title = {{How Good Are Popular Matchings?}},
booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-070-5},
ISSN = {1868-8969},
year = {2018},
volume = {103},
editor = {D'Angelo, Gianlorenzo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.9},
URN = {urn:nbn:de:0030-drops-89440},
doi = {10.4230/LIPIcs.SEA.2018.9},
annote = {Keywords: bipartite graphs, hospital residents, lower-quotas, popular matchings}
}