{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:00Z","timestamp":1750306500665,"version":"3.41.0"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2015,11,12]],"date-time":"2015-11-12T00:00:00Z","timestamp":1447286400000},"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":["SIGecom Exch."],"published-print":{"date-parts":[[2015,11,12]]},"abstract":"<jats:p>In this letter we briefly discuss our main result from [Cole and Gkatzelis 2015]. Given a set of indivisible items and a set of agents having additive valuations, our goal is to allocate the items to the agents in order to maximize the geometric mean of the agents' valuations, i.e., the Nash social welfare. This problem is known to be NP-hard, and our main result is the first efficient constant-factor approximation algorithm for this objective.<\/jats:p>","DOI":"10.1145\/2845926.2845931","type":"journal-article","created":{"date-parts":[[2015,11,13]],"date-time":"2015-11-13T14:19:41Z","timestamp":1447424381000},"page":"84-88","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximating the nash social welfare with indivisible items"],"prefix":"10.1145","volume":"14","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[{"name":"New York University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilis","family":"Gkatzelis","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746589"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706369"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914191"},{"volume-title":"Fair Division and Collective Welfare","author":"Moulin H.","key":"e_1_2_1_4_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_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/1907266"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.09.010"},{"key":"e_1_2_1_7_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"}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2845926.2845931","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2845926.2845931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:51Z","timestamp":1750225731000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2845926.2845931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,12]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,11,12]]}},"alternative-id":["10.1145\/2845926.2845931"],"URL":"https:\/\/doi.org\/10.1145\/2845926.2845931","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2015,11,12]]},"assertion":[{"value":"2015-11-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}