{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:17:32Z","timestamp":1781259452688,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":4,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1750436"],"award-info":[{"award-number":["CCF-1750436"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538255","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"1106-1107","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness"],"prefix":"10.1145","author":[{"given":"Bhaskar Ray","family":"Chaudhury","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jugal","family":"Garg","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"McGlaughlin","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruta","family":"Mehta","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Bhaskar Ray Chaudhury Jugal Garg Peter McGlaughlin and Ruta Mehta. [n.d.]. Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness. ([n. d.]). http:\/\/jugal.ise.illinois.edu\/ec22-fullversion.pdf  Bhaskar Ray Chaudhury Jugal Garg Peter McGlaughlin and Ruta Mehta. [n.d.]. Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness. ([n. d.]). http:\/\/jugal.ise.illinois.edu\/ec22-fullversion.pdf"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411512"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. 21st Conf. Auton. Agents and Multi-Agent Systems (AAMAS). To appear.","author":"Ebadian Soroush","year":"2022","unstructured":"Soroush Ebadian , Dominik Peters , and Nisarg Shah . 2022 . How to Fairly Allocate Easy and Difficult Chores . In Proc. 21st Conf. Auton. Agents and Multi-Agent Systems (AAMAS). To appear. Soroush Ebadian, Dominik Peters, and Nisarg Shah. 2022. How to Fairly Allocate Easy and Difficult Chores. In Proc. 21st Conf. Auton. Agents and Multi-Agent Systems (AAMAS). To appear."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i5.20436"}],"event":{"name":"EC '22: The 23rd ACM Conference on Economics and Computation","location":"Boulder CO USA","acronym":"EC '22","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538255","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538255","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:04Z","timestamp":1750188664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":4,"alternative-id":["10.1145\/3490486.3538255","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538255","relation":{},"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2022-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}