{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:30:12Z","timestamp":1725795012524},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_4","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T01:30:40Z","timestamp":1401672640000},"page":"39-51","source":"Crossref","is-referenced-by-count":1,"title":["Counting Popular Matchings in House Allocation Problems"],"prefix":"10.1007","author":[{"given":"Rupam","family":"Acharyya","sequence":"first","affiliation":[]},{"given":"Sourav","family":"Chakraborty","sequence":"additional","affiliation":[]},{"given":"Nitesh","family":"Jha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/06067328X","volume":"37","author":"D.J. Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM J. Comput.\u00a037(4), 1030\u20131045 (2007)","journal-title":"SIAM J. Comput."},{"key":"4_CR2","unstructured":"Bhatnagar, N., Greenberg, S., Randall, D.: Sampling stable marriages: why spouse-swapping won\u2019t work. In: SODA, pp. 1223\u20131232 (2008)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-15369-3_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"P. Chebolu","year":"2010","unstructured":"Chebolu, P., Goldberg, L.A., Martin, R.A.: The complexity of approximately counting stable matchings. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX 2010. LNCS, vol.\u00a06302, pp. 81\u201394. Springer, Heidelberg (2010)"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. The American Mathematical Monthly\u00a069(1), 9\u201315 (1962)","journal-title":"The American Mathematical Monthly"},{"issue":"3","key":"4_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/bs.3830200304","volume":"20","author":"P. G\u00e4rdenfors","year":"1975","unstructured":"G\u00e4rdenfors, P.: Match making: assignments based on bilateral preferences. Behavioral Science\u00a020(3), 166\u2013173 (1975)","journal-title":"Behavioral Science"},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"R.W. Irving","year":"1986","unstructured":"Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM J. Comput.\u00a015(3), 655\u2013667 (1986)","journal-title":"SIAM J. Comput."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. In: STOC, pp. 712\u2013721 (2001)","DOI":"10.1145\/380752.380877"},{"issue":"24","key":"4_CR8","doi-asserted-by":"publisher","first-page":"2679","DOI":"10.1016\/j.tcs.2010.03.028","volume":"412","author":"T. Kavitha","year":"2011","unstructured":"Kavitha, T., Mestre, J., Nasre, M.: Popular mixed matchings. Theor. Comput. Sci.\u00a0412(24), 2679\u20132690 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR9","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching theory. North-Holland Mathematics Studies, vol.\u00a0121. North-Holland Publishing Co., Amsterdam (1986), Annals of Discrete Mathematics, 29"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Mahdian, M.: Random popular matchings. In: ACM Conference on Electronic Commerce, pp. 238\u2013242 (2006)","DOI":"10.1145\/1134707.1134733"},{"key":"4_CR11","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)"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10878-009-9287-9","volume":"22","author":"E. McDermid","year":"2011","unstructured":"McDermid, E., Irving, R.W.: Popular matchings: structure and algorithms. J. Comb. Optim.\u00a022(3), 339\u2013358 (2011)","journal-title":"J. Comb. Optim."},{"key":"4_CR13","unstructured":"Nasre, M.: Popular matchings: Structure and cheating strategies. In: STACS, pp. 412\u2013423 (2013)"},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.jda.2008.11.008","volume":"8","author":"C.T.S. Sng","year":"2010","unstructured":"Sng, C.T.S., Manlove, D.: Popular matchings in the weighted capacitated house allocation problem. J. Discrete Algorithms\u00a08(2), 102\u2013116 (2010)","journal-title":"J. Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:47:34Z","timestamp":1558900054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}