{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:10:33Z","timestamp":1725617433415},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248283"},{"type":"electronic","value":"9783642248290"}],"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-24829-0_8","type":"book-chapter","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T13:11:38Z","timestamp":1317647498000},"page":"69-80","source":"Crossref","is-referenced-by-count":2,"title":["Throw One\u2019s Cake \u2014 and Eat It Too"],"prefix":"10.1007","author":[{"given":"Orit","family":"Arzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonatan","family":"Aumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yair","family":"Dombb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","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)"},{"issue":"1","key":"8_CR2","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. The American Mathematical Monthly\u00a0102(1), 9\u201318 (1995)","journal-title":"The American Mathematical Monthly"},{"key":"8_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair Division: From cake cutting to dispute resolution","author":"S.J. Brams","year":"1996","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division: From cake cutting to dispute resolution. Cambridge University Press, New York (1996)"},{"key":"8_CR4","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)"},{"key":"8_CR5","unstructured":"Caragiannis, I., Lai, J., Procaccia, A.: Towards more expressive cake cutting. In: IJCAI: International Joint Conferences on Artificial Intelligence (2011)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Lai, J., Parkes, D.C., Procaccia, A.D.: Truth, justice, and cake cutting. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7621"},{"issue":"1","key":"8_CR7","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. The American Mathematical Monthly\u00a068(1), 1\u201317 (1961)","journal-title":"The American Mathematical Monthly"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1145\/1109557.1109588","volume-title":"SODA 2006: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm","author":"J. Edmonds","year":"2006","unstructured":"Edmonds, J., Pruhs, K.: Cake cutting really is not a piece of cake. In: SODA 2006: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 271\u2013278. ACM, New York (2006)"},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0166-218X(84)90005-2","volume":"7","author":"S. Even","year":"1984","unstructured":"Even, S., Paz, A.: A note on cake cutting. Discrete Applied Mathematics\u00a07(3), 285\u2013296 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/3-540-36494-3_52","volume-title":"STACS 2003","author":"M. Magdon-Ismail","year":"2003","unstructured":"Magdon-Ismail, M., Busch, C., Krishnamoorthy, M.S.: Cake-cutting is not a piece of cake. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 596\u2013607. Springer, Heidelberg (2003)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Moulin, H.J.: Fair Division and Collective Welfare. Number 0262633116 in MIT Press Books. The MIT Press (2004)","DOI":"10.7551\/mitpress\/2954.001.0001"},{"key":"8_CR12","unstructured":"Procaccia, A.D.: Thou shalt covet thy neighbor\u2019s cake. In: IJCAI, pp. 239\u2013244 (2009)"},{"key":"8_CR13","doi-asserted-by":"crossref","DOI":"10.1201\/9781439863855","volume-title":"Cake-cutting algorithms: Be fair if you can","author":"J. Robertson","year":"1998","unstructured":"Robertson, J., Webb, W.: Cake-cutting algorithms: Be fair if you can. A K Peters, Ltd., Natick (1998)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-540-39658-1_42","volume-title":"Algorithms - ESA 2003","author":"J. Sgall","year":"2003","unstructured":"Sgall, J., Woeginger, G.J.: A lower bound for cake cutting. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 459\u2013469. Springer, Heidelberg (2003)"},{"issue":"Supplement: Rep","key":"8_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.2307\/1907319","volume":"17","author":"H. Steinhaus","year":"1949","unstructured":"Steinhaus, H.: Sur la division pragmatique. Econometrica\u00a017(Supplement: Report of the Washington Meeting), 315\u2013319 (1949)","journal-title":"Econometrica"},{"issue":"8","key":"8_CR16","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. The American Mathematical Monthly\u00a087(8), 640\u2013644 (1980)","journal-title":"The American Mathematical Monthly"}],"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-24829-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T06:53:38Z","timestamp":1686380018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24829-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248283","9783642248290"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24829-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]]}}}