{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:29Z","timestamp":1760202629158},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229343"},{"type":"electronic","value":"9783642229350"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22935-0_8","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T05:20:39Z","timestamp":1313126439000},"page":"87-98","source":"Crossref","is-referenced-by-count":13,"title":["Social Welfare in One-Sided Matching Markets without Money"],"prefix":"10.1007","author":[{"given":"Anand","family":"Bhalgat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deeparnab","family":"Chakrabarty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0022-0531(03)00091-7","volume":"112","author":"A. Abdulkadiroglu","year":"2003","unstructured":"Abdulkadiroglu, A., S\u00f6nmez, T.: Ordinal efficiency and dominated sets of assignments. Journal of Economic Theory\u00a0112, 157\u2013172 (2003)","journal-title":"Journal of Economic Theory"},{"key":"8_CR2","unstructured":"Abdulkadiroglu, A., S\u00f6nmez, T.: Matching markets: Theory and practice. Prepared for the Econometric Society World Congress, China (2010), available at first author\u2019s website"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/06067328X","volume":"37","author":"D. Abraham","year":"2007","unstructured":"Abraham, D., Irving, R., Kavitha, T., Melhorn, K.: Popular matchings. SIAM Journ. of Computing\u00a037, 1030\u20131045 (2007)","journal-title":"SIAM Journ. of Computing"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: SODA (2011)","DOI":"10.1137\/1.9781611973082.95"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Fischer, F., Kash, I., Procaccia, A.D.: Mix and Match. In: Proceedings of the ACM Conference on Electronic Commerce, EC 2010 (2010)","DOI":"10.1145\/1807342.1807392"},{"key":"8_CR6","unstructured":"Bhalgat, A., Chakrabarty, D., Khanna, S.: Social welfare in one-sided matching markets without money. Technical report, http:\/\/arxiv.org\/abs\/1104.2964"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Birnbaum, B., Mathieu, C.: On-line bipartite matching made simple. ACM SIGACT News\u00a039 (2008)","DOI":"10.1145\/1360443.1360462"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A. Bogomolnaia","year":"2001","unstructured":"Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. Journal of Economic Theory\u00a0100, 295\u2013328 (2001)","journal-title":"Journal of Economic Theory"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s001990100168","volume":"19","author":"A. Bogomolnaia","year":"2002","unstructured":"Bogomolnaia, A., Moulin, H.: A simple random assignment problem with a unique solution. Economic Theory\u00a019, 623\u2013635 (2002)","journal-title":"Economic Theory"},{"key":"8_CR10","unstructured":"Budish, E., Che, Y.K., Kojima, F., Milgrom, P.: Designing random allocation mechanisms: Theory and applications. Unpublished Manuscript available at first author\u2019s personal webpage (October 2010)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1287\/opre.49.4.565.11224","volume":"49","author":"H. Cres","year":"2001","unstructured":"Cres, H., Moulin, H.: Scheduling with opting out: Improving upon random priority. Operations Research\u00a049, 565\u2013577 (2001)","journal-title":"Operations Research"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Ghosh, A.: Truthful assignment without money. In: Proceedings of the 11th ACM Conference on Electronic Commerce, EC 2010 (2010)","DOI":"10.1145\/1807342.1807394"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. American Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/bs.3830200304","volume":"20","author":"P. Gardenfors","year":"1975","unstructured":"Gardenfors, P.: Match making: assignments based on bilateral preferences. Behavorial Sciences\u00a020, 166\u2013173 (1975)","journal-title":"Behavorial Sciences"},{"key":"8_CR15","unstructured":"Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: Symposium on Discrete Algorithms, SODA (2008)"},{"key":"8_CR16","unstructured":"Guo, M., Conitzer, V.: Strategy-proof allocation of multiple items between two agents without payments or priors. In: 9th International Joint Conference on Autonomous Agents and Multi Agent Systems, AAMAS 2010 (2010)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Huang, C.-C., Kavitha, T., Michail, D., Nasre, M.: Bounded unpopularity matchings. In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (2008)","DOI":"10.1007\/978-3-540-69903-3_13"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"A. Hylland","year":"1962","unstructured":"Hylland, A., Zeckhauser, R.: The efficient allocation of individuals to positions. American Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Karp, R., Vazirani, U., Vazirani, V.: An optimal algorithm for online bipartite matching. In: 22nd Annual ACM Symposium on Theory of Computing (1990)","DOI":"10.1145\/100216.100262"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.jet.2005.05.001","volume":"131","author":"A.K. Katta","year":"2006","unstructured":"Katta, A.K., Sethurman, J.: A solution to the random assignment problem on the full preference domain. Journal of Economic Theory\u00a0131, 231\u2013250 (2006)","journal-title":"Journal of Economic Theory"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Mestre, J., Nasre, M.: Popular mixed matchings. Theoretical Computer Science, Article in Press (2010)","DOI":"10.1007\/978-3-642-02927-1_48"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-78773-0_51","volume-title":"LATIN 2008: Theoretical Informatics","author":"R.M. McCutchen","year":"2008","unstructured":"McCutchen, R.M.: The least-unpopularity-factor and least-unpopularity-margin criteria for matching problems with one-sided preferences. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 593\u2013604. Springer, Heidelberg (2008)"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: Proceedings of the 10th ACM Conference on Electronic Commerce, EC 2009 (2009)","DOI":"10.1145\/1566374.1566401"},{"key":"8_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-Sided Matching: A Study on Game- Theoretic Modelling","author":"A.E. Roth","year":"1990","unstructured":"Roth, A.E., Sotomayor, M.: Two-Sided Matching: A Study on Game- Theoretic Modelling. Cambridge University Press, Cambridge (1990)"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"S\u00f6nmez, T., \u00dcnver, U.: Matching, allocation, and exchange of discrete resources. In: Handbook of Social Economics, forthcoming, available at second author\u2019s website","DOI":"10.1016\/B978-0-444-53187-2.00017-6"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s003550050160","volume":"16","author":"L. Svensson","year":"1999","unstructured":"Svensson, L.: Strategyproof allocation of indivisible goods. Social Choice and Welfare\u00a016, 557\u2013567 (1999)","journal-title":"Social Choice and Welfare"},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0022-0531(90)90070-Z","volume":"52","author":"L. Zhou","year":"1990","unstructured":"Zhou, L.: On a conjecture by gale about one-sided matching problems. Journal of Economic Theory\u00a052, 123\u2013135 (1990)","journal-title":"Journal of Economic Theory"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22935-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T21:03:22Z","timestamp":1560459802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22935-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229343","9783642229350"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22935-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}