{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:51:26Z","timestamp":1767340286311,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,16]]},"DOI":"10.1145\/2492002.2482582","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T16:03:50Z","timestamp":1370966630000},"page":"251-268","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Mechanism design for fair division"],"prefix":"10.1145","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[{"name":"New York University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilis","family":"Gkatzelis","sequence":"additional","affiliation":[{"name":"New York University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gagan","family":"Goel","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Aggarwal R. and Harper J. Winter 2000. Equity valuation in the czech voucher privatization auctions. Financial Management 77--100.  Aggarwal R. and Harper J. Winter 2000. Equity valuation in the czech voucher privatization auctions. Financial Management 77--100.","DOI":"10.2307\/3666369"},{"key":"e_1_3_2_1_2_1","unstructured":"Andrews M. Qian L. and Stolyar A. L. 2005. Optimal utility based multi-user throughput allocation subject to throughput constraints. In INFOCOM. 2415--2424.  Andrews M. Qian L. and Stolyar A. L. 2005. Optimal utility based multi-user throughput allocation subject to throughput constraints. In INFOCOM. 2415--2424."},{"volume-title":"The Geometry of Efficient Fair Division","author":"Barbanel J.","key":"e_1_3_2_1_3_1","unstructured":"Barbanel , J. 2004. The Geometry of Efficient Fair Division . Cambridge University Press . Barbanel, J. 2004. The Geometry of Efficient Fair Division. Cambridge University Press."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Brams S. and Taylor A. 1996. Fair Division: from cake cutting to dispute resolution. Cambridge University Press Cambridge.  Brams S. and Taylor A. 1996. Fair Division: from cake cutting to dispute resolution. Cambridge University Press Cambridge.","DOI":"10.1017\/CBO9780511598975"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807406.1807480"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-011-9359-y"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Chen Y. Lai J. Parkes D. and Procaccia A. 2010. Truth justice and cake cutting. In AAAI.  Chen Y. Lai J. Parkes D. and Procaccia A. 2010. Truth justice and cake cutting. In AAAI.","DOI":"10.1609\/aaai.v24i1.7621"},{"key":"e_1_3_2_1_8_1","first-page":"3","article-title":"Issues in multiagent resource allocation","volume":"30","author":"Chevaleyre Y.","year":"2006","unstructured":"Chevaleyre , Y. , Dunne , P. , Endriss , U. , Lang , J. , Lema\u00eetre , M. , Maudet , N. , Padget , J. , Phelps , S. , Rodr\u00edguez-Aguilar , J. , and Sousa , P. 2006 . Issues in multiagent resource allocation . Informatica (Slovenia) 30 , 1, 3 -- 31 . Chevaleyre, Y., Dunne, P., Endriss, U., Lang, J., Lema\u00eetre, M., Maudet, N., Padget, J., Phelps, S., Rodr\u00edguez-Aguilar, J., and Sousa, P. 2006. Issues in multiagent resource allocation. Informatica (Slovenia) 30, 1, 3--31.","journal-title":"Informatica (Slovenia)"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Cohler Y. Lai J. Parkes D. and Procaccia A. 2011. Optimal envy-free cake cutting. In AAAI.  Cohler Y. Lai J. Parkes D. and Procaccia A. 2011. Optimal envy-free cake cutting. In AAAI.","DOI":"10.1609\/aaai.v25i1.7874"},{"key":"e_1_3_2_1_10_1","unstructured":"Cole R. Gkatzelis V. and Goel G. 2013. Positive results for mechanism design without money. In AAMAS.   Cole R. Gkatzelis V. and Goel G. 2013. Positive results for mechanism design without money. In AAMAS."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1086\/261411"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411512"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090243"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.7.4.337"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706369"},{"volume-title":"NSDI'11","author":"Ghodsi A.","key":"e_1_3_2_1_16_1","unstructured":"Ghodsi , A. , Zaharia , M. , Hindman , B. , Konwinski , A. , Shenker , S. , and Stoica , I . 2011. Dominant resource fairness: fair allocation of multiple resource types . NSDI'11 . 24--24. Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., and Stoica, I. 2011. Dominant resource fairness: fair allocation of multiple resource types. NSDI'11. 24--24."},{"key":"e_1_3_2_1_17_1","unstructured":"Guo M. and Conitzer V. 2010. Strategy-proof allocation of multiple items between two agents without payments or priors. In AAMAS. 881--888.   Guo M. and Conitzer V. 2010. Strategy-proof allocation of multiple items between two agents without payments or priors. In AAMAS. 881--888."},{"key":"e_1_3_2_1_18_1","unstructured":"Gutman A. and Nisan N. 2012. Fair allocation without trade. In AAMAS. 719--728.   Gutman A. and Nisan N. 2012. Fair allocation without trade. In AAMAS. 719--728."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_16"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374390"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250845"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460080106"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600523"},{"key":"e_1_3_2_1_24_1","unstructured":"Mas-Colell A. Whinston M. and Green J. 1995. Microeconomic Theory. Oxford.  Mas-Colell A. Whinston M. and Green J. 1995. Microeconomic Theory. Oxford."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_13"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Mossel E. and Tamuz O. 2010. Truthful fair division. In SAGT. 288--299.   Mossel E. and Tamuz O. 2010. Truthful fair division. In SAGT. 288--299.","DOI":"10.1007\/978-3-642-16170-4_25"},{"volume-title":"Fair Division and Collective Welfare","author":"Moulin H.","key":"e_1_3_2_1_27_1","unstructured":"Moulin , H. 2003. Fair Division and Collective Welfare . The MIT Press . Moulin, H. 2003. Fair Division and Collective Welfare. The MIT Press."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/1907266"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings oh the International Congress of Mathematicians. 413--444","author":"Nemirovski A.","year":"2006","unstructured":"Nemirovski , A. 2006 . Advances in convex optimization: conic programming . In Proceedings oh the International Congress of Mathematicians. 413--444 . Nemirovski, A. 2006. Advances in convex optimization: conic programming. In Proceedings oh the International Congress of Mathematicians. 413--444."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Nisan N. Roughgarden T. Tardos \u00c9. and Vazirani V. 2007. Algorithmic Game Theory. Cambridge University Press New York NY USA.   Nisan N. Roughgarden T. Tardos \u00c9. and Vazirani V. 2007. Algorithmic Game Theory. Cambridge University Press New York NY USA.","DOI":"10.1017\/CBO9780511800481"},{"volume-title":"AAMAS '10","author":"Othman A.","key":"e_1_3_2_1_31_1","unstructured":"Othman , A. , Sandholm , T. , and Budish , E . 2010. Finding approximate competitive equilibria: efficient and fair course allocation . AAMAS '10 . Richland, SC, 873--880. Othman, A., Sandholm, T., and Budish, E. 2010. Finding approximate competitive equilibria: efficient and fair course allocation. AAMAS '10. Richland, SC, 873--880."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229075"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566401"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Robertson J. and Webb W. 1998. Cake-cutting algorithms - be fair if you can. A K Peters.  Robertson J. and Webb W. 1998. Cake-cutting algorithms - be fair if you can. A K Peters.","DOI":"10.1201\/9781439863855"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(74)90075-1"},{"key":"e_1_3_2_1_36_1","unstructured":"Young H. 1995. Equity. Princeton University Press.  Young H. 1995. Equity. Princeton University Press."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2010.37"}],"event":{"name":"EC '13: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Philadelphia Pennsylvania USA","acronym":"EC '13"},"container-title":["Proceedings of the fourteenth ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482582","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2492002.2482582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:11Z","timestamp":1750235951000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482582"}},"subtitle":["allocating divisible items without payments"],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":37,"alternative-id":["10.1145\/2492002.2482582","10.1145\/2492002"],"URL":"https:\/\/doi.org\/10.1145\/2492002.2482582","relation":{},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}