{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T02:37:36Z","timestamp":1777603056172,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642108402","type":"print"},{"value":"9783642108419","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10841-9_45","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T17:14:44Z","timestamp":1260292484000},"page":"475-482","source":"Crossref","is-referenced-by-count":14,"title":["The Efficiency of Fair Division"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Kanellopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Kyropoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"45_CR1","doi-asserted-by":"publisher","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 Journal of Computing\u00a038(4), 1602\u20131623 (2008)","journal-title":"SIAM Journal of Computing"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC 2006), pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"key":"45_CR3","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)"},{"key":"45_CR4","doi-asserted-by":"crossref","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 2006), pp. 271\u2013278 (2006)","DOI":"10.1145\/1109557.1109588"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Kumar, A., Kleinberg, J.: Fairness measures for resource allocation. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), pp. 75\u201385 (2000)","DOI":"10.1109\/SFCS.2000.892067"},{"key":"45_CR6","doi-asserted-by":"crossref","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 2004), pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"45_CR7","unstructured":"Procaccia, A.: Thou shalt covet thy neighbor\u2019s cake. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009 (2009)"},{"key":"45_CR8","doi-asserted-by":"publisher","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 Optimization\u00a04, 213\u2013220 (2007)","journal-title":"Discrete Optimization"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10841-9_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:42:32Z","timestamp":1619782952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}