{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:32:35Z","timestamp":1771979555217,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642255090","type":"print"},{"value":"9783642255106","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25510-6_24","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T08:51:09Z","timestamp":1322643069000},"page":"278-289","source":"Crossref","is-referenced-by-count":17,"title":["On Worst-Case Allocations in the Presence of Indivisible Goods"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Markakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos-Alexandros","family":"Psomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. In: ACM Symposium on Theory of Computing (STOC), pp. 114\u2013121 (2007)","DOI":"10.1145\/1250790.1250808"},{"key":"24_CR2","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division: from Cake Cutting to Dispute Resolution. Cambrige University press (1986)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Y., Lai, J., Parkes, D., Procaccia, A.: Truth, justice, and cake cutting. In: AAAI, pp. 756\u2013761 (2010)","DOI":"10.1609\/aaai.v24i1.7621"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0165-4896(88)90047-9","volume":"16","author":"S. Demko","year":"1988","unstructured":"Demko, S., Hill, T.: Equitable distribution of indivisible items. Mathematical Social Sciences\u00a016, 145\u2013158 (1988)","journal-title":"Mathematical Social Sciences"},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1214\/aop\/1176992173","volume":"15","author":"T. Hill","year":"1987","unstructured":"Hill, T.: Partitioning general probability measures. The Annals of Probability\u00a015(2), 804\u2013813 (1987)","journal-title":"The Annals of Probability"},{"key":"24_CR6","doi-asserted-by":"publisher","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. Mathematical Programming\u00a046, 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-16170-4_25","volume-title":"Algorithmic Game Theory","author":"E. Mossel","year":"2010","unstructured":"Mossel, E., Tamuz, O.: Truthful Fair Division. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol.\u00a06386, pp. 288\u2013299. Springer, Heidelberg (2010)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Robertson, J.M., Webb, W.A.: Cake Cutting Algorithms: be fair if you can. AK Peters (1998)","DOI":"10.1201\/9781439863855"},{"key":"24_CR9","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"}],"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-25510-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T06:07:30Z","timestamp":1686463650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25510-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255090","9783642255106"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25510-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}