{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:23:03Z","timestamp":1725751383084},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642413919"},{"type":"electronic","value":"9783642413926"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41392-6_15","type":"book-chapter","created":{"date-parts":[[2013,10,9]],"date-time":"2013-10-09T03:30:26Z","timestamp":1381289426000},"page":"171-182","source":"Crossref","is-referenced-by-count":0,"title":["Dividing Connected Chores Fairly"],"prefix":"10.1007","author":[{"given":"Sandy","family":"Heydrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","first-page":"101","volume":"16","author":"H. Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica\u00a016, 101\u2013104 (1948)","journal-title":"Econometrica"},{"key":"15_CR2","unstructured":"Gardner, M.: Aha! Insight. W. F. Freeman and Co. (1978)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Robertson, J.M., Webb, W.A.: Cake-cutting algorithms - be fair if you can. A K Peters (1998)","DOI":"10.1201\/9781439863855"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-17572-5_3","volume-title":"Internet and Network Economics","author":"Y. Aumann","year":"2010","unstructured":"Aumann, Y., Dombb, Y.: The efficiency of fair division with connected pieces. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 26\u201337. Springer, Heidelberg (2010)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-642-10841-9_45","volume-title":"Internet and Network Economics","author":"I. Caragiannis","year":"2009","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 475\u2013482. Springer, Heidelberg (2009)"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2974850","volume":"102","author":"S.J. Brams","year":"1995","unstructured":"Brams, S.J., Taylor, A.D.: An envy-free cake division protocol. American Mathematical Monthly\u00a0102(1), 9\u201318 (1995)","journal-title":"American Mathematical Monthly"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1090\/S0002-9939-97-03614-9","volume":"125","author":"S.J. Brams","year":"1997","unstructured":"Brams, S.J., Taylor, A.D., Zwicker, W.: A moving-knife solution to the four-person envy-free cake division. Proceedings of the American Mathematical Society\u00a0125, 547\u2013554 (1997)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2311357","volume":"68","author":"L.E. Dubins","year":"1961","unstructured":"Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. American Mathematical Monthly\u00a068(1), 1\u201317 (1961)","journal-title":"American Mathematical Monthly"},{"issue":"8","key":"15_CR9","doi-asserted-by":"publisher","first-page":"640","DOI":"10.2307\/2320951","volume":"87","author":"W. Stromquist","year":"1980","unstructured":"Stromquist, W.: How to cut a cake fairly. American Mathematical Monthly\u00a087(8), 640\u2013644 (1980)","journal-title":"American Mathematical Monthly"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.2307\/3219145","volume":"75","author":"E. Peterson","year":"2002","unstructured":"Peterson, E., Su, F.E.: Four-person envy-free chore division. Mathematics Magazine\u00a075(2), 117\u2013122 (2002)","journal-title":"Mathematics Magazine"},{"key":"15_CR11","unstructured":"Peterson, E., Su, F.E.: N-person envy-free chore division. arXiv.org:0909.0303 (2009)"},{"issue":"10","key":"15_CR12","doi-asserted-by":"publisher","first-page":"930","DOI":"10.2307\/2589747","volume":"106","author":"F.E. Su","year":"1999","unstructured":"Su, F.E.: Rental harmony: Sperner\u2019s lemma in fair division. American Mathematical Monthly\u00a0106(10), 930\u2013942 (1999)","journal-title":"American Mathematical Monthly"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Cohler, Y.J., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Optimal envy-free cake cutting. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (2011)","DOI":"10.1609\/aaai.v25i1.7874"},{"key":"15_CR14","unstructured":"Bei, X., Chen, N., Hua, X., Tao, B., Yang, E.: Optimal proportional cake cutting with connected pieces. In: [17]"},{"key":"15_CR15","unstructured":"Brams, S.J., Feldman, M., Lai, J.K., Morgenstern, J., Procaccia, A.D.: On maxsum fair cake divisions. In: [17]"},{"key":"15_CR16","unstructured":"Hoffman, Y., Aumann, Y., Dombb, Y.: Private communication"},{"key":"15_CR17","unstructured":"Hoffmann, J., Selman, B. (eds.): Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, Toronto, Ontario, Canada, July 22-26. AAAI Press (2012)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41392-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T06:26:55Z","timestamp":1688538415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41392-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642413919","9783642413926"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41392-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}