{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:27:00Z","timestamp":1778851620418,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T00:00:00Z","timestamp":1315440000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s00224-011-9359-y","type":"journal-article","created":{"date-parts":[[2011,9,7]],"date-time":"2011-09-07T13:08:32Z","timestamp":1315400912000},"page":"589-610","source":"Crossref","is-referenced-by-count":99,"title":["The Efficiency of Fair Division"],"prefix":"10.1007","volume":"50","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[]},{"given":"Panagiotis","family":"Kanellopoulos","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Kyropoulou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,8]]},"reference":[{"issue":"4","key":"9359_CR1","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"9359_CR2","doi-asserted-by":"crossref","first-page":"2970","DOI":"10.1137\/080723491","volume":"39","author":"A. Asadpour","year":"2010","unstructured":"Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. SIAM J. Comput. 39(7), 2970\u20132989 (2010)","journal-title":"SIAM J. Comput."},{"key":"9359_CR3","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/978-3-642-17572-5_3","volume-title":"Proceedings of the 6th International Workshop on Internet and Network Economics (WINE\u201910)","author":"Y. Aumann","year":"2010","unstructured":"Aumann, Y., Dombb, Y.: The efficiency of fair division with connected pieces. In: Proceedings of the 6th International Workshop on Internet and Network Economics (WINE\u201910). LNCS, vol.\u00a06484. Springer, Berlin, pp. 26\u201337 (2010)"},{"key":"9359_CR4","first-page":"31","volume-title":"Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC \u201906)","author":"N. Bansal","year":"2006","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC \u201906), pp. 31\u201340 (2006)"},{"key":"9359_CR5","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1145\/1536414.1536488","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC \u201909)","author":"M. Bateni","year":"2009","unstructured":"Bateni, M., Charikar, M., Guruswami, V.: Maxmin allocation via degree lower-bounded arborescences. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC \u201909), pp. 543\u2013552 (2009)"},{"issue":"3","key":"9359_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1120680.1120683","volume":"5","author":"I. Bez\u00e1kov\u00e1","year":"2005","unstructured":"Bez\u00e1kov\u00e1, I., Dani, V.: Allocating indivisible goods. SIGecom Exch. 5(3), 11\u201318 (2005)","journal-title":"SIGecom Exch."},{"key":"9359_CR7","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1613\/jair.2467","volume":"32","author":"S. Bouveret","year":"2008","unstructured":"Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. J. Artif. Intell. Res. 32, 525\u2013564 (2008)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"9359_CR8","doi-asserted-by":"crossref","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. Am. Math. Mon. 102(1), 9\u201318 (1995)","journal-title":"Am. Math. Mon."},{"key":"9359_CR9","doi-asserted-by":"crossref","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, Cambridge (1996)"},{"issue":"2","key":"9359_CR10","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1090\/S0002-9939-97-03614-9","volume":"125","author":"S.J. Brams","year":"1997","unstructured":"Brams, S.J., Taylor, A.D., Zwicker, W.S.: A moving-knife solution to the four-person envy free cake division problem. Proc. Am. Math. Soc. 125(2), 547\u2013554 (1997)","journal-title":"Proc. Am. Math. Soc."},{"key":"9359_CR11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/1148109.1148159","volume-title":"Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA \u201906)","author":"N. Buchbinder","year":"2006","unstructured":"Buchbinder, N., Naor, J.: Fair online load balancing. In: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA \u201906), pp. 291\u2013298 (2006)"},{"key":"9359_CR12","first-page":"107","volume-title":"Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS \u201909)","author":"D. Chakrabarty","year":"2009","unstructured":"Chakrabarty, D., Chuzhoy, J., Khanna, S.: On allocating goods to maximize fairness. In: Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS \u201909), pp. 107\u2013116 (2009)"},{"key":"9359_CR13","first-page":"1239","volume-title":"Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI \u201907)","author":"Y. Chevaleyre","year":"2007","unstructured":"Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Reaching envy-free states in distributed negotiation settings. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI \u201907), pp. 1239\u20131244 (2007)"},{"key":"9359_CR14","first-page":"700","volume-title":"Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI \u201907)","author":"Y. Chevaleyre","year":"2007","unstructured":"Chevaleyre, Y., Endriss, U., Maudet, N.: Allocating goods on a graph to eliminate envy. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI \u201907), pp. 700\u2013705 (2007)"},{"key":"9359_CR15","unstructured":"Deng, X., Qi, Q., Saberi, A.: On the complexity of envy-free cake cutting. Manuscript, arXiv: 0907.1334 [cs.GT] (2009)"},{"key":"9359_CR16","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1145\/1109557.1109588","volume-title":"Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201906)","author":"J. Edmonds","year":"2006","unstructured":"Edmonds, J., Pruhs, K.: Cake-cutting really is not a piece of cake. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201906), pp. 271\u2013278 (2006)"},{"key":"9359_CR17","doi-asserted-by":"crossref","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, 285\u2013296 (1984)","journal-title":"Discrete Appl. Math."},{"key":"9359_CR18","unstructured":"Golovin, D.: Max-min fair allocation of indivisible goods. Technical Report, Carnegie Mellon University, CMU-CS-05-144, (2005)"},{"issue":"1","key":"9359_CR19","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jcss.2001.1752","volume":"63","author":"J. Kleinberg","year":"2001","unstructured":"Kleinberg, J., Rabani, Y., Tardos, E.: Fairness in routing and load balancing. J. Comput. Syst. Sci. 63(1), 2\u201320 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9359_CR20","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/S0097539703434966","volume":"36","author":"A. Kumar","year":"2006","unstructured":"Kumar, A., Kleinberg, J.: Fairness measures for resource allocation. SIAM J. Comput. 36(3), 657\u2013680 (2006)","journal-title":"SIAM J. Comput."},{"key":"9359_CR21","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"9359_CR22","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1145\/988772.988792","volume-title":"Proceedings of the 5th ACM Conference on Electronic Commerce (EC \u201904)","author":"R. Lipton","year":"2004","unstructured":"Lipton, R., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Electronic Commerce (EC \u201904), pp. 125\u2013131 (2004)"},{"key":"9359_CR23","series-title":"LNCS","first-page":"596","volume-title":"Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS \u201903)","author":"M. Magdon-Ismail","year":"2003","unstructured":"Magdon-Ismail, M., Busch, C., Krishnamoorthy, M.S.: Cake-cutting is not a piece of cake. In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS \u201903), LNCS, vol.\u00a02607, pp. 596\u2013607. Springer, Berlin (2003)"},{"key":"9359_CR24","first-page":"239","volume-title":"Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI \u201909)","author":"A. Procaccia","year":"2009","unstructured":"Procaccia, A.: Thou shalt covet thy neighbor\u2019s cake. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI \u201909), pp. 239\u2013244 (2009)"},{"key":"9359_CR25","doi-asserted-by":"crossref","DOI":"10.1201\/9781439863855","volume-title":"Cake-Cutting Algorithms: Be Fair if You Can","author":"J.M. Robertson","year":"1998","unstructured":"Robertson, J.M., Webb, W.A.: Cake-Cutting Algorithms: Be Fair if You Can. AK Peters Ltd, Wellesley (1998)"},{"key":"9359_CR26","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/978-3-642-02158-9_25","volume-title":"Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM \u201909)","author":"A. Saberi","year":"2009","unstructured":"Saberi, A., Wang, Y.: Cutting a cake for five people. In: Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM \u201909), pp. 292\u2013300 (2009)"},{"key":"9359_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":"9359_CR28","doi-asserted-by":"crossref","first-page":"640","DOI":"10.2307\/2320951","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":"9359_CR29","volume":"15","author":"W. Stromquist","year":"2008","unstructured":"Stromquist, W.: Envy-free cake divisions cannot be found by finite protocols. Electron. J. Comb. 15, R11 (2008)","journal-title":"Electron. J. Comb."},{"issue":"2","key":"9359_CR30","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0165-4896(93)90047-M","volume":"25","author":"K. Tadenuma","year":"1993","unstructured":"Tadenuma, K., Thomson, W.: The fair allocation of an indivisible good when monetary compensations are possible. Math. Soc. Sci. 25(2), 117\u2013132 (1993)","journal-title":"Math. Soc. Sci."},{"key":"9359_CR31","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.disopt.2006.07.003","volume":"4","author":"G.J. Woeginger","year":"2007","unstructured":"Woeginger, G.J., Sgall, J.: On the complexity of cake-cutting. Discrete Optim. 4, 213\u2013220 (2007)","journal-title":"Discrete Optim."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9359-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9359-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9359-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T02:23:29Z","timestamp":1560565409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9359-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,8]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["9359"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9359-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,8]]}}}