{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:12:33Z","timestamp":1725484353078},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438588"},{"type":"electronic","value":"9783540454489"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45448-9_20","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T13:03:25Z","timestamp":1179752605000},"page":"277-289","source":"Crossref","is-referenced-by-count":0,"title":["Improving Optimality of n Agent Envy-Free Divisions"],"prefix":"10.1007","author":[{"given":"Stephen W.","family":"Nuchia","sequence":"first","affiliation":[]},{"given":"Sandip","family":"Sen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"20_CR1","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":"Steven J. Brams and Alan D. Taylor. Fair Division: From cake-cutting to dispute resolution. Cambridge University Press, Cambridge: UK, 1996."},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"B-69","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds. Maximal matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards, B-69:125\u2013130, 1965.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Michael N. Huhns and Anuj K. Malhotra. Negotiating for goods and services. IEEE Internet Computing, 3(4), 1999.","DOI":"10.1109\/4236.780967"},{"key":"20_CR4","doi-asserted-by":"crossref","DOI":"10.1201\/9781439863855","volume-title":"Cake Cutting Algorithms","author":"J. Robertson","year":"1998","unstructured":"J. Robertson and W. Webb. Cake Cutting Algorithms. A. K. Peters, Natick, MA, 1998."},{"volume-title":"Handbook of Discrete and Combinatorial Mathematics","year":"2000","key":"20_CR5","unstructured":"Kenneth H. Rosen, editor. Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton, LA, 2000."},{"key":"20_CR6","unstructured":"J. S. Rosenschein and G. Zlotkin. Designing conventions for automated negotiation. AI Magazine, pages 29\u201346, Fall 1994."},{"key":"20_CR7","unstructured":"Sandip Sen and Anish Biswas. More than envy-free. In Working Notes of theAAAI-99 Workshop on \u201dNegotiation: Settling Conflicts and Identifying Opportunities\u201d, pages 44\u201349, 1999. AAAI Technical Report WS-99-12."},{"key":"20_CR8","unstructured":"Sandip Sen and Rajatish Mukherjee. Negotiating efficient envy-free divisions. In 2001 AAAI Fall Symposium on Negotiation Methods for Autonomous COoperative Systems, pages 149\u2013154, Menlo Park, CA, 2001. AAAI Press. AAAI Tech Report FS-01-03."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"I. Stewart. Mathematical recreations: Division without envy. Scientific American, January 1999.","DOI":"10.1038\/scientificamerican0199-110"}],"container-title":["Lecture Notes in Computer Science","Intelligent Agents VIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45448-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T02:40:36Z","timestamp":1556419236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45448-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438588","9783540454489"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45448-9_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}