{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:39:25Z","timestamp":1762101565005,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K01000X\/1 and EP\/K010042\/1"],"award-info":[{"award-number":["EP\/K01000X\/1 and EP\/K010042\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1145\/2600057.2602868","type":"proceedings-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T18:18:31Z","timestamp":1401473911000},"page":"453-470","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Size versus truthfulness in the house allocation problem"],"prefix":"10.1145","author":[{"given":"Piotr","family":"Krysta","sequence":"first","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Manlove","sequence":"additional","affiliation":[{"name":"University of Glasgow, Glasgow, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baharak","family":"Rastegari","sequence":"additional","affiliation":[{"name":"University of Glasgow, Glasgow, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinshan","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/2998580"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30551-4_3"},{"volume-title":"Proc. SODA '11","author":"AGGARWAL G.","key":"e_1_3_2_1_3_1","unstructured":"AGGARWAL , G. , GOEL , G. , KARANDE , C. , AND MEHTA , A. 2011. Online vertex-weighted bipartite matching and single-bid budgeted allocations . In Proc. SODA '11 . ACM-SIAM , 1253--1264. AGGARWAL, G., GOEL, G., KARANDE, C., AND MEHTA, A. 2011. Online vertex-weighted bipartite matching and single-bid budgeted allocations. In Proc. SODA '11. ACM-SIAM, 1253--1264."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2013.08.006"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. AAMAS","author":"AZIZ H.","year":"2014","unstructured":"AZIZ , H. , GASPERS , S. , MACKENZIE , S. , AND WALSH , T. 2014 . Fair assignment of indivisible objects under ordinal preferences . In Proc. AAMAS 2014, to appear. AZIZ, H., GASPERS, S., MACKENZIE, S., AND WALSH, T. 2014. Fair assignment of indivisible objects under ordinal preferences. In Proc. AAMAS 2014, to appear."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1399589.1399596"},{"key":"e_1_3_2_1_7_1","unstructured":"BADE S. 2013. Random serial dictatorship: The one and the only. Unpublished manuscript available from http:\/\/www.coll.mpg.de\/sites\/www.coll.mpg.de\/files\/workshop\/newproof5.pdf.  BADE S. 2013. Random serial dictatorship: The one and the only. Unpublished manuscript available from http:\/\/www.coll.mpg.de\/sites\/www.coll.mpg.de\/files\/workshop\/newproof5.pdf."},{"key":"e_1_3_2_1_8_1","series-title":"LNCS Series","volume-title":"Proc. APPROX+RANDOM '11","author":"BHALGAT A.","unstructured":"BHALGAT , A. , CHAKRABARTY , D. , AND KHANNA , S. 2011. Social welfare in one-sided matching markets without money . In Proc. APPROX+RANDOM '11 . LNCS Series , vol. 6845 . Springer , 87--98. BHALGAT, A., CHAKRABARTY, D., AND KHANNA, S. 2011. Social welfare in one-sided matching markets without money. In Proc. APPROX+RANDOM '11. LNCS Series, vol. 6845. Springer, 87--98."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.2000.2710"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0262.2004.00483.x"},{"key":"e_1_3_2_1_11_1","unstructured":"BOGOMOLNAIA A. AND MOULIN H. 2013. Size versus fairness in the assignment problem. Unpublished manuscript available from http:\/\/www.gla.ac.uk\/media\/media 295542 en.pdf.  BOGOMOLNAIA A. AND MOULIN H. 2013. Size versus fairness in the assignment problem. Unpublished manuscript available from http:\/\/www.gla.ac.uk\/media\/media 295542 en.pdf."},{"volume-title":"IM Preprint series A, no. 4\/2013","author":"CECHL\u00c1 ROV\u00c1 K.","key":"e_1_3_2_1_12_1","unstructured":"CECHL\u00c1 ROV\u00c1 , K. , EIRINAKIS , P. , FLEINER , T. , MAGOS , D. , MOURTOS , I. , AND POTPINKOV\u00c1 , E. 2013. Pareto optimality in many-to-many matching problems. Tech. rep ., IM Preprint series A, no. 4\/2013 , PJ Saf\u00e1rik University, Faculty of Science, Institute of Mathematics . December. CECHL\u00c1 ROV\u00c1, K., EIRINAKIS, P., FLEINER, T., MAGOS, D., MOURTOS, I., AND POTPINKOV\u00c1, E. 2013. Pareto optimality in many-to-many matching problems. Tech. rep., IM Preprint series A, no. 4\/2013, PJ Saf\u00e1rik University, Faculty of Science, Institute of Mathematics. December."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554810"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. COMSOC '10","author":"CHEN N.","year":"2010","unstructured":"CHEN , N. AND GHOSH , A. 2010 . Algorithms for Pareto stable assignment . In Proc. COMSOC '10 , V. Conitzer and J. Rothe, Eds. D\u00fcsseldorf University Press, 343--354. CHEN, N. AND GHOSH, A. 2010. Algorithms for Pareto stable assignment. In Proc. COMSOC '10, V. Conitzer and J. Rothe, Eds. D\u00fcsseldorf University Press, 343--354."},{"volume-title":"Proc. SODA '13","author":"DEVANUR N. R.","key":"e_1_3_2_1_15_1","unstructured":"DEVANUR , N. R. , JAIN , K. , AND KLEINBERG , R. 2013. Randomized primal-dual analysis of RANKING for online bipartite matching . In Proc. SODA '13 . ACM-SIAM , 101--107. DEVANUR, N. R., JAIN, K., AND KLEINBERG, R. 2013. Randomized primal-dual analysis of RANKING for online bipartite matching. In Proc. SODA '13. ACM-SIAM, 101--107."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9457-2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807394"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2871897.2871905"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1086\/260757"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2012.05.017"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"MANLOVE D. 2013. Algorithmics of Matching Under Preferences. World Scientific.  MANLOVE D. 2013. Algorithmics of Matching Under Preferences. World Scientific.","DOI":"10.1142\/8591"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00166"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2542174.2542175"},{"key":"e_1_3_2_1_25_1","unstructured":"PYCIA M. AND \u00dc NVER M. 2014. Incentive compatible allocation and exchange of discrete resources. Unpublished manuscript available from http:\/\/pycia.bol.ucla.edu\/pycia-unver-tcbo.pdf.  PYCIA M. AND \u00dc NVER M. 2014. Incentive compatible allocation and exchange of discrete resources. Unpublished manuscript available from http:\/\/pycia.bol.ucla.edu\/pycia-unver-tcbo.pdf."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4068(77)90004-0"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2005.04.004"},{"key":"e_1_3_2_1_28_1","series-title":"LNCS Series","volume-title":"Proc. WINE '13","author":"SABAN D.","unstructured":"SABAN , D. AND SETHURAMAN , J. 2013a. The complexity of computing the random priority allocation matrix . In Proc. WINE '13 . LNCS Series , vol. 8289 . Springer , 421. Full version available at http:\/\/www.columbia.edu\/~js1353\/pubs\/rpcomplexity.pdf. SABAN, D. AND SETHURAMAN, J. 2013a. The complexity of computing the random priority allocation matrix. In Proc. WINE '13. LNCS Series, vol. 8289. Springer, 421. Full version available at http:\/\/www.columbia.edu\/~js1353\/pubs\/rpcomplexity.pdf."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482574"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00183301"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(90)90070-Z"}],"event":{"name":"EC '14: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Palo Alto California USA","acronym":"EC '14"},"container-title":["Proceedings of the fifteenth ACM conference on Economics and computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600057.2602868","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2600057.2602868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:21Z","timestamp":1750230081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600057.2602868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":31,"alternative-id":["10.1145\/2600057.2602868","10.1145\/2600057"],"URL":"https:\/\/doi.org\/10.1145\/2600057.2602868","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"2014-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}