{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T22:32:11Z","timestamp":1725834731064},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319255231"},{"type":"electronic","value":"9783319255248"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-25524-8_8","type":"book-chapter","created":{"date-parts":[[2015,10,21]],"date-time":"2015-10-21T22:57:56Z","timestamp":1445468276000},"page":"118-133","source":"Crossref","is-referenced-by-count":1,"title":["Strategy-Proof Cake Cutting Mechanisms for\u00a0All-or-Nothing Utility"],"prefix":"10.1007","author":[{"given":"Takamasa","family":"Ihara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunsuke","family":"Tsuruta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taiki","family":"Todo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuko","family":"Sakurai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Yokoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,28]]},"reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.2307\/2998580","volume":"66","author":"A Abdulkadiro\u011flu","year":"1998","unstructured":"Abdulkadiro\u011flu, A., S\u00f6nmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 66(3), 689\u2013701 (1998)","journal-title":"Econometrica"},{"unstructured":"Aziz, H., Ye, C.: New cake cutting algorithms: a random assignment approach to cake cutting. The Computing Research Repository abs\/1307.2908 (2013)","key":"8_CR2"},{"issue":"11","key":"8_CR3","first-page":"1314","volume":"53","author":"SJ Brams","year":"2006","unstructured":"Brams, S.J., Jones, M.A., Klamler, C.: Better ways to cut a cake. Notices of the American Mathematical Society 53(11), 1314\u20131321 (2006)","journal-title":"Notices of the American Mathematical Society"},{"doi-asserted-by":"crossref","unstructured":"Brams, S.J., Taylor, A.D.: An envy-free cake division protocol. American Mathematical Monthly, 9\u201318 (1995)","key":"8_CR4","DOI":"10.1080\/00029890.1995.11990526"},{"issue":"8","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TPDS.2007.70818","volume":"19","author":"TE Carroll","year":"2008","unstructured":"Carroll, T.E., Grosu, D.: Strategyproof mechanisms for scheduling divisible loads in bus-networked distributed systems. IEEE Transactions on Parallel and Distributed Systems 19(8), 1124\u20131135 (2008)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.geb.2012.10.009","volume":"77","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Truth, justice, and cake cutting. Games and Economic Behavior 77(1), 284\u2013297 (2013)","journal-title":"Games and Economic Behavior"},{"unstructured":"Gamow, G., Stern, M.: Puzzle-math. Macmillan (1958)","key":"8_CR7"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0206029","volume":"6","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: Two-processor scheduling with start-times and deadlines. SIAM Journal on Computing 6(3), 416\u2013426 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM (JACM) 20(1), 46\u201361 (1973)","journal-title":"Journal of the ACM (JACM)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-35311-6_13","volume-title":"Internet and Network Economics","author":"A Maya","year":"2012","unstructured":"Maya, A., Nisan, N.: Incentive compatible two player cake cutting. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 170\u2013183. Springer, Heidelberg (2012)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-16170-4_25","volume-title":"Algorithmic Game Theory","author":"E Mossel","year":"2010","unstructured":"Mossel, E., Tamuz, O.: Truthful fair division. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 288\u2013299. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2015: Principles and Practice of Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25524-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T08:15:00Z","timestamp":1559290500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25524-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319255231","9783319255248"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25524-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}