{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T12:17:22Z","timestamp":1760098642043,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030353889"},{"type":"electronic","value":"9783030353896"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35389-6_5","type":"book-chapter","created":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T06:06:49Z","timestamp":1574316409000},"page":"57-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Fair and Efficient Cake Division with Connected Pieces"],"prefix":"10.1007","author":[{"given":"Eshwar Ram","family":"Arunachaleswaran","sequence":"first","affiliation":[]},{"given":"Siddharth","family":"Barman","sequence":"additional","affiliation":[]},{"given":"Rachitesh","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Nidhi","family":"Rathi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,3]]},"reference":[{"key":"5_CR1","unstructured":"Adjusted winner. http:\/\/www.nyu.edu\/projects\/adjustedwinner\/ . Accessed 07 July 2019"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S Arora","year":"1999","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. J. Comput. Syst. Sci. 58(1), 193\u2013210 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM (JACM) 45(3), 501\u2013555 (1998)","journal-title":"J. ACM (JACM)"},{"key":"5_CR4","unstructured":"Arunachaleswaran, E.R., Barman, S., Kumar, R., Rathi, N.: Fair and efficient cake division with connected pieces. CoRR abs\/1907.11019 (2019). http:\/\/arxiv.org\/abs\/1907.11019"},{"key":"5_CR5","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. 6484, pp. 26\u201337. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_3"},{"key":"5_CR6","unstructured":"Aumann, Y., Dombb, Y., Hassidim, A.: Computing socially-efficient cake divisions. In: Proceedings of the 2013 International Conference on Autonomous Agents and Multi-Agent Systems, pp. 343\u2013350. International Foundation for Autonomous Agents and Multiagent Systems (2013)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 416\u2013427. IEEE (2016)","DOI":"10.1109\/FOCS.2016.52"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-13129-0_1","volume-title":"Web and Internet Economics","author":"H Aziz","year":"2014","unstructured":"Aziz, H., Ye, C.: Cake cutting algorithms for piecewise constant and piecewise uniform valuations. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 1\u201314. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_1"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/S0097539799354138","volume":"31","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput. 31(2), 331\u2013352 (2001)","journal-title":"SIAM J. Comput."},{"key":"5_CR10","unstructured":"Bei, X., Chen, N., Hua, X., Tao, B., Yang, E.: Optimal proportional cake cutting with connected pieces. In: Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)"},{"key":"5_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair Division: From Cake-Cutting to Dispute Resolution","author":"SJ Brams","year":"1996","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press, Cambridge (1996)"},{"key":"5_CR12","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. 5929, pp. 475\u2013482. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_45"},{"key":"5_CR13","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 2016 ACM Conference on Economics and Computation, pp. 305\u2013322. ACM (2016)","DOI":"10.1145\/2940716.2940726"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Cohler, Y.J., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Optimal envy-free cake cutting. In: Twenty-Fifth AAAI Conference on Artificial Intelligence (2011)","DOI":"10.1609\/aaai.v25i1.7874"},{"issue":"6","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1287\/opre.1120.1116","volume":"60","author":"X Deng","year":"2012","unstructured":"Deng, X., Qi, Q., Saberi, A.: Algorithmic solutions for envy-free cake cutting. Oper. Res. 60(6), 1461\u20131476 (2012)","journal-title":"Oper. Res."},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1214\/aoms\/1177706369","volume":"30","author":"E Eisenberg","year":"1959","unstructured":"Eisenberg, E., Gale, D.: Consensus of subjective probabilities: the pari-mutuel method. Ann. Math. Stat. 30(1), 165\u2013168 (1959)","journal-title":"Ann. Math. Stat."},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0196-6774(02)00291-2","volume":"46","author":"T Erlebach","year":"2003","unstructured":"Erlebach, T., Spieksma, F.C.: Interval selection: applications, algorithms, and lower bounds. J. Algorithms 46(1), 27\u201353 (2003)","journal-title":"J. Algorithms"},{"key":"5_CR18","unstructured":"Foley, D.K.: Resource allocation and the public sector (1967)"},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/2728732.2728738","volume":"13","author":"JR Goldman","year":"2014","unstructured":"Goldman, J.R., Procaccia, A.D.: Spliddit: unleashing fair division algorithms. SIGecom Exch. 13(2), 41\u201346 (2014)","journal-title":"SIGecom Exch."},{"issue":"2","key":"5_CR20","first-page":"423","volume":"47","author":"M Kaneko","year":"1979","unstructured":"Kaneko, M., Nakamura, K.: The Nash social welfare function. Econ. J. Econ. Soc. 47(2), 423\u2013435 (1979)","journal-title":"Econ. J. Econ. Soc."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Lai, J.K., Procaccia, A.D.: How to cut a cake before the party ends. In: Twenty-Seventh AAAI Conference on Artificial Intelligence (2013)","DOI":"10.1609\/aaai.v27i1.8629"},{"key":"5_CR22","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 Electronic Commerce, pp. 125\u2013131. ACM (2004)","DOI":"10.1145\/988772.988792"},{"issue":"2","key":"5_CR23","first-page":"155","volume":"18","author":"JF Nash Jr","year":"1950","unstructured":"Nash Jr., J.F.: The bargaining problem. Econ. J. Econ. Soc. 18(2), 155\u2013162 (1950)","journal-title":"Econ. J. Econ. Soc."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D.: Cake cutting algorithms. In: Handbook of Computational Social Choice, Chapter 13. Citeseer (2015)","DOI":"10.1017\/CBO9781107446984.014"},{"key":"5_CR25","doi-asserted-by":"publisher","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\/CRC Press, Boca Raton (1998)"},{"key":"5_CR26","unstructured":"Simmons, F.: Private communication to Michael Starbird (1980)"},{"key":"5_CR27","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":"8","key":"5_CR28","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."},{"issue":"1","key":"5_CR29","doi-asserted-by":"crossref","first-page":"11","DOI":"10.37236\/735","volume":"15","author":"W Stromquist","year":"2008","unstructured":"Stromquist, W.: Envy-free cake divisions cannot be found by finite protocols. Electron. J. Comb. 15(1), 11 (2008)","journal-title":"Electron. J. Comb."},{"issue":"10","key":"5_CR30","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":"5_CR31","doi-asserted-by":"crossref","unstructured":"Varian, H.R.: Equity, envy, and efficiency (1973)","DOI":"10.1016\/0042-207X(73)92318-X"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35389-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T15:09:24Z","timestamp":1665068964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35389-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030353889","9783030353896"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35389-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wine2019.cs.columbia.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}