{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:13:34Z","timestamp":1743041614293,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319666990"},{"type":"electronic","value":"9783319667003"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","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":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_26","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"333-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fairly Allocating Contiguous Blocks of Indivisible Items"],"prefix":"10.1007","author":[{"given":"Warut","family":"Suksompong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0001-8708(87)90055-7","volume":"63","author":"N Alon","year":"1987","unstructured":"Alon, N.: Splitting necklaces. Adv. Math. 63(3), 247\u2013253 (1987)","journal-title":"Adv. Math."},{"issue":"4","key":"26_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/2781776","volume":"3","author":"Y Aumann","year":"2015","unstructured":"Aumann, Y., Dombb, Y.: The efficiency of fair division with connected pieces. ACM Trans. Econ. Comput. 3(4), 23 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"key":"26_CR3","unstructured":"Aumann, Y., Dombb, Y., Hassidim, A.: Computing socially-efficient cake divisions. In: Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems, pp. 343\u2013350 (2013)"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s11856-014-1137-5","volume":"206","author":"I B\u00e1r\u00e1ny","year":"2015","unstructured":"B\u00e1r\u00e1ny, I., Grinberg, V.S.: Block partitions of sequences. Isr. J. Math. 206(1), 155\u2013164 (2015)","journal-title":"Isr. J. Math."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Hua, X., Tao, B., Yang, E.: Optimal proportional cake cutting with connected pieces. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence, pp. 1263\u20131269 (2012)","DOI":"10.1609\/aaai.v26i1.8243"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2015.10.046","volume":"613","author":"V Bil\u00f2","year":"2016","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Monaco, G., Moscardelli, L.: The price of envy-freeness in machine scheduling. Theor. Comput. Sci. 613, 65\u201378 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Cechl\u00e1rov\u00e1, K., Elkind, E., Igarashi, A., Peters, D.: Fair division of a graph. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (2017, forthcoming)","DOI":"10.24963\/ijcai.2017\/20"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-011-9359-y","volume":"50","author":"I Caragiannis","year":"2012","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. Theory Comput. Syst. 50, 589\u2013610 (2012)","journal-title":"Theory Comput. Syst."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. In: Proceedings of the 17th ACM Conference on Economics and Computation, pp. 305\u2013322 (2016)","DOI":"10.1145\/2940716.2940726"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2012.11.024","volume":"228","author":"K Cechl\u00e1rov\u00e1","year":"2013","unstructured":"Cechl\u00e1rov\u00e1, K., Dobo\u0161, J., Pill\u00e1rov\u00e1, E.: On the existence of equitable cake divisions. Inf. Sci. 228, 239\u2013245 (2013)","journal-title":"Inf. Sci."},{"key":"26_CR11","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 25th AAAI Conference on Artificial Intelligence, pp. 626\u2013631 (2011)","DOI":"10.1609\/aaai.v25i1.7874"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Dickerson, J.P., Goldman, J., Karp, J., Procaccia, A.D., Sandholm, T.: The computational rise and fall of fairness. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 1405\u20131411 (2014)","DOI":"10.1609\/aaai.v28i1.8884"},{"issue":"1","key":"26_CR13","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."},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2015.05.041","volume":"593","author":"S Heydrich","year":"2015","unstructured":"Heydrich, S., van Stee, R.: Dividing connected chores fairly. Theor. Comput. Sci. 593, 51\u201361 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Economics and Computation, pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"26_CR16","unstructured":"Manurangsi, P., Suksompong, W.: Asymptotic existence of fair divisions for groups. Math. Soc. Sci. (Forthcoming)"},{"issue":"8","key":"26_CR17","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1080\/00029890.1980.11995109","volume":"87","author":"W Stromquist","year":"1980","unstructured":"Stromquist, W.: How to cut a cake fairly. Am. Math. Mon. 87(8), 640\u2013644 (1980)","journal-title":"Am. Math. Mon."},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Stromquist, W.: Envy-free cake divisions cannot be found by finite protocols. Electron. J. Comb. 15, 11 (2008)","DOI":"10.37236\/735"},{"issue":"10","key":"26_CR19","doi-asserted-by":"publisher","first-page":"930","DOI":"10.2307\/2589747","volume":"106","author":"FE Su","year":"1999","unstructured":"Su, F.E.: Rental harmony: Sperner\u2019s lemma in fair division. Am. Math. Mon. 106(10), 930\u2013942 (1999)","journal-title":"Am. Math. Mon."},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.mathsocsci.2016.03.007","volume":"81","author":"W Suksompong","year":"2016","unstructured":"Suksompong, W.: Asymptotic existence of proportionally fair allocations. Math. Soc. Sci. 81, 62\u201365 (2016)","journal-title":"Math. Soc. Sci."}],"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-66700-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:27:47Z","timestamp":1709828867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","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":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}