{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:25:58Z","timestamp":1778495158722,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642044274","type":"print"},{"value":"9783642044281","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04428-1_10","type":"book-chapter","created":{"date-parts":[[2009,10,9]],"date-time":"2009-10-09T12:05:58Z","timestamp":1255089958000},"page":"111-119","source":"Crossref","is-referenced-by-count":12,"title":["On Low-Envy Truthful Allocations"],"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":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Saberi, A.: Max-min fair allocation of indivisible goods. In: Proceedings of the 39th ACM Symposium on Theory of Computing (STOC 2007), pp. 114\u2013121 (2007)","DOI":"10.1145\/1250790.1250808"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the 38th ACM Symposium on Theory of Computing (STOC 2006), pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","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 Exchanges\u00a05(3), 11\u201318 (2005)","journal-title":"SIGecom Exchanges"},{"key":"10_CR4","doi-asserted-by":"publisher","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. Journal of Artificial Intelligence Research\u00a032, 525\u2013564 (2008)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1995.11990526","volume":"102","author":"S.J. Brams","year":"1995","unstructured":"Brams, S.J., Taylor, A.D.: An envy-free cake division protocol. The American Mathematical Monthly\u00a0102(1), 9\u201318 (1995)","journal-title":"The American Mathematical Monthly"},{"key":"10_CR6","doi-asserted-by":"publisher","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":"10_CR7","doi-asserted-by":"publisher","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. Proceedings of the American Mathematical Society\u00a0125(2), 547\u2013554 (1997)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"10_CR8","first-page":"85","volume":"86","author":"C. Busch","year":"2005","unstructured":"Busch, C., Krishnamoorthy, M.S., Magdon-Ismail, M.: Hardness results for cake-cutting. Bulletin of the EATCS\u00a086, 85\u2013106 (2005)","journal-title":"Bulletin of the EATCS"},{"key":"10_CR9","first-page":"3","volume":"30","author":"Y. Chevaleyre","year":"2006","unstructured":"Chevaleyre, Y., Dunne, P.E., Endriss, U., Lang, J., Lema\u00eetre, M., Maudet, N., Padget, J., Phelps, S., Rodr\u00edguez-Aguilar, J.A., Sousa, P.: Issues in multiagent resource allocation. Informatica\u00a030, 3\u201331 (2006)","journal-title":"Informatica"},{"key":"10_CR10","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 2007), pp. 1239\u20131244 (2007)"},{"key":"10_CR11","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 2007), pp. 700\u2013705 (2007)"},{"key":"10_CR12","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":"10_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 Applied Mathematics\u00a07, 285\u2013296 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR14","unstructured":"Golovin, D.: Max-min fair allocation of indivisible goods. Technical Report, Carnegie Mellon University, CMU-CS-05-144 (2005)"},{"issue":"301","key":"10_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association\u00a058(301), 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"10_CR16","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":"10_CR17","unstructured":"Mu\u2019alem, A., Schapira, M.: Setting lower bounds on truthfulness. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 1143\u20131152 (2007)"},{"key":"10_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N.: Introduction to mechanism design (for computer scientists). In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic game theory. Cambridge University Press, Cambridge (2007)"},{"key":"10_CR19","unstructured":"Proccacia, A.: Thou shalt covet thy neighbor\u2019s cake. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009 (to appear, 2009)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Robertson, J.M., Webb, W.A.: Cake-cutting algorithms: Be fair if you can. AK Peters Ltd. (1998)","DOI":"10.1201\/9781439863855"},{"key":"10_CR21","first-page":"101","volume":"16","author":"H. Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica\u00a016, 101\u2013104 (1948)","journal-title":"Econometrica"},{"issue":"8","key":"10_CR22","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. American Mathematical Monthly\u00a087(8), 640\u2013644 (1980)","journal-title":"American Mathematical Monthly"},{"key":"10_CR23","doi-asserted-by":"publisher","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. The Electronic Journal of Combinatorics\u00a015, R11 (2008)","journal-title":"The Electronic Journal of Combinatorics"},{"key":"10_CR24","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","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04428-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T10:03:18Z","timestamp":1602324198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04428-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044274","9783642044281"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04428-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}