{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:58:51Z","timestamp":1742925531822,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319996592"},{"type":"electronic","value":"9783319996608"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99660-8_3","type":"book-chapter","created":{"date-parts":[[2018,8,26]],"date-time":"2018-08-26T18:19:21Z","timestamp":1535307561000},"page":"19-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Complexity of Cake Cutting with Unequal Shares"],"prefix":"10.1007","author":[{"given":"\u00c1gnes","family":"Cseh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Fleiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.4064\/cm-69-1-59-73","volume":"69","author":"JB Barbanel","year":"1996","unstructured":"Barbanel, J.B.: Game-theoretic algorithms for fair and strongly fair cake division with entitlements. Colloq. Math. 69, 59\u201373 (1996)","journal-title":"Colloq. Math."},{"issue":"6","key":"3_CR2","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1080\/00029890.2009.11920966","volume":"116","author":"JB Barbanel","year":"2009","unstructured":"Barbanel, J.B., Brams, S.J., Stromquist, W.: Cutting a pie is not a piece of cake. Am. Math. Mon. 116(6), 496\u2013514 (2009)","journal-title":"Am. Math. Mon."},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00029890.1987.12000609","volume":"94","author":"A Beck","year":"1987","unstructured":"Beck, A.: Constructing a fair border. Am. Math. Mon. 94(2), 157\u2013162 (1987)","journal-title":"Am. Math. Mon."},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-4068(92)90001-N","volume":"21","author":"M Berliant","year":"1992","unstructured":"Berliant, M., Thomson, W., Dunz, K.: On the fair division of a heterogeneous commodity. J. Math. Econ. 21(3), 201\u2013216 (1992)","journal-title":"J. Math. Econ."},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00182-007-0108-z","volume":"36","author":"SJ Brams","year":"2008","unstructured":"Brams, S.J., Jones, M.A., Klamler, C.: Proportional pie-cutting. Int. J. Game Theory 36(3), 353\u2013367 (2008)","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/080729475","volume":"53","author":"SJ Brams","year":"2011","unstructured":"Brams, S.J., Jones, M.A., Klamler, C.: Divide-and-conquer: a proportional, minimal-envy cake-cutting algorithm. SIAM Rev. 53(2), 291\u2013307 (2011)","journal-title":"SIAM Rev."},{"issue":"2","key":"3_CR7","first-page":"15","volume":"3","author":"E Carney","year":"2012","unstructured":"Carney, E.: A new algorithm for the cake-cutting problem of unequal shares for rational ratios: the divisor reduction method. Sci. Terrapin 3(2), 15\u201322 (2012)","journal-title":"Sci. Terrapin"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Cohler, Y.J., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Optimal envy-free cake cutting. In: 25th AAAI Conference on Artificial Intelligence (2011)","DOI":"10.1609\/aaai.v25i1.7874"},{"key":"3_CR9","unstructured":"Cseh, \u00c1., Fleiner, T.: The complexity of cake cutting with unequal shares. CoRR abs\/1709.03152 (2018). http:\/\/arxiv.org\/abs\/1709.03152"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0377-0427(99)00393-3","volume":"130","author":"M Dall\u2019Aglio","year":"2001","unstructured":"Dall\u2019Aglio, M.: The Dubins-Spanier optimization problem in fair division theory. J. Comput. Appl. Math. 130(1), 17\u201340 (2001)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2311357","volume":"68","author":"LE Dubins","year":"1961","unstructured":"Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. Am. Math. Mon. 68(1), 1\u201317 (1961)","journal-title":"Am. Math. Mon."},{"issue":"4","key":"3_CR12","first-page":"51","volume":"7","author":"J Edmonds","year":"2011","unstructured":"Edmonds, J., Pruhs, K.: Cake cutting really is not a piece of cake. ACM Trans. Algorithms (TALG) 7(4), 51 (2011)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"3","key":"3_CR13","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 Appl. Math. 7(3), 285\u2013296 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"3_CR14","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1080\/00029890.1983.11971254","volume":"90","author":"TP Hill","year":"1983","unstructured":"Hill, T.P.: Determining a fair border. Am. Math. Mon. 90(7), 438\u2013442 (1983)","journal-title":"Am. Math. Mon."},{"issue":"03n04","key":"3_CR15","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1142\/S0218843009002051","volume":"18","author":"K Iyer","year":"2009","unstructured":"Iyer, K., Huhns, M.N.: A procedure for the allocation of two-dimensional resources in a multiagent system. Int. J. Coop. Inf. Syst. 18(03n04), 381\u2013422 (2009)","journal-title":"Int. J. Coop. Inf. Syst."},{"key":"3_CR16","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. 2607, pp. 596\u2013607. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_52"},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01204722","volume":"12","author":"K McAvaney","year":"1992","unstructured":"McAvaney, K., Robertson, J., Webb, W.: Ramsey partitions of integers and pair divisions. Combinatorica 12(2), 193\u2013201 (1992)","journal-title":"Combinatorica"},{"key":"3_CR18","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. AK Peters, Natick (1998)"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmateco.2017.01.007","volume":"70","author":"E Segal-Halevi","year":"2017","unstructured":"Segal-Halevi, E., Nitzan, S., Hassidim, A., Aumann, Y.: Fair and square: cake-cutting in two dimensions. J. Math. Econ. 70, 1\u201328 (2017)","journal-title":"J. Math. Econ."},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1008620404353","volume":"8","author":"H Shishido","year":"1999","unstructured":"Shishido, H., Zeng, D.Z.: Mark-choose-cut algorithms for fair and strongly fair division. Group Decis. Negot. 8(2), 125\u2013137 (1999)","journal-title":"Group Decis. Negot."},{"key":"3_CR21","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16, 101\u2013104 (1948)","journal-title":"Econometrica"},{"issue":"2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.disopt.2006.07.003","volume":"4","author":"GJ Woeginger","year":"2007","unstructured":"Woeginger, G.J., Sgall, J.: On the complexity of cake cutting. Discrete Optim. 4(2), 213\u2013220 (2007)","journal-title":"Discrete Optim."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99660-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:40:11Z","timestamp":1709833211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99660-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319996592","9783319996608"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99660-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aims.sjtu.edu.cn\/SAGT_2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}