{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:10:55Z","timestamp":1778497855814,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_9","type":"book-chapter","created":{"date-parts":[[2009,10,9]],"date-time":"2009-10-09T12:05:58Z","timestamp":1255089958000},"page":"98-110","source":"Crossref","is-referenced-by-count":27,"title":["On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences"],"prefix":"10.1007","author":[{"given":"Bart","family":"de Keijzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Bouveret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomas","family":"Klos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingqian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","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); Survey paper","journal-title":"Informatica"},{"key":"9_CR2","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.: Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge Univ. Press, Cambridge (1996)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0165-4896(88)90047-9","volume":"16","author":"S. Demko","year":"1998","unstructured":"Demko, S., Hill, T.P.: Equitable distribution of indivisible items. Mathematical Social Sciences\u00a016, 145\u2013158 (1998)","journal-title":"Mathematical Social Sciences"},{"issue":"1-2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0004-3702(98)00045-9","volume":"101","author":"O. Shehory","year":"1998","unstructured":"Shehory, O., Kraus, S.: Methods for Task Allocation via Agent Coalition Formation. Artificial Intelligence\u00a0101(1-2), 165\u2013200 (1998)","journal-title":"Artificial Intelligence"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/3-540-45578-7_56","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"P.J. Modi","year":"2001","unstructured":"Modi, P.J., Jung, H., Tambe, M., Shen, W.M., Kulkarni, S.: A dynamic distributed constraint satisfaction approach to resource allocation. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 685\u2013700. Springer, Heidelberg (2001)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"de Weerdt, M.M., Zhang, Y., Klos, T.B.: Distributed task allocation in social networks. In: Huhns, M., Shehory, O. (eds.) Proceedings of the 6th International Conference on Autonomous Agents and Multiagent Systems, Bradford, UK, pp. 488\u2013495. IFAAMAS, Research Publishing Services (2007)","DOI":"10.1145\/1329125.1329217"},{"key":"9_CR7","first-page":"125","volume-title":"EC 2004: Proceedings of the 5th ACM conference on Electronic commerce","author":"R.J. Lipton","year":"2004","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: EC 2004: Proceedings of the 5th ACM conference on Electronic commerce, pp. 125\u2013131. ACM Press, New York (2004)"},{"key":"9_CR8","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 (JAIR)\u00a032, 525\u2013564 (2008)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"issue":"1-2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.artint.2005.01.006","volume":"164","author":"P.E. Dunne","year":"2005","unstructured":"Dunne, P.E., Wooldridge, M., Laurence, M.: The complexity of contract negotiation. Artificial Intelligence\u00a0164(1-2), 23\u201346 (2005)","journal-title":"Artificial Intelligence"},{"key":"9_CR10","unstructured":"Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Multiagent resource allocation with k-additive utility functions. In: Proceedings of the First International Workshop on Computer Science and Decision Theory, Paris, France, pp. 83\u2013100 (2004)"},{"key":"9_CR11","first-page":"248","volume-title":"Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005)","author":"V. Conitzer","year":"2005","unstructured":"Conitzer, V., Sandholm, T., Santi, P.: Combinatorial auctions with k-wise dependent valuations. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 248\u2013254. AAAI Press, Menlo Park (2005)"},{"key":"9_CR12","unstructured":"Schaefer, M., Umans, C.: Completeness in the polynomial-time hierarchy: a compendium. SIGACT News (September 2002)"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1177\/1043463105058317","volume":"17","author":"S.J. Brams","year":"2005","unstructured":"Brams, S.J., King, D.L.: Efficient fair division: Help the worst off or avoid envy? Rationality and Society\u00a017(4), 387\u2013421 (2005)","journal-title":"Rationality and Society"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T10:04:23Z","timestamp":1602324263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04428-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044274","9783642044281"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04428-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}