{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:24:20Z","timestamp":1742930660132,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030859466"},{"type":"electronic","value":"9783030859473"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85947-3_22","type":"book-chapter","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:45:22Z","timestamp":1631580322000},"page":"329-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["When Dividing Mixed Manna Is Easier Than Dividing Goods: Competitive Equilibria with a Constant Number of Chores"],"prefix":"10.1007","author":[{"given":"Jugal","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"McGlaughlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Schmalhofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Aziz, H., Caragiannis, I., Igarashi, A., Walsh, T.: Fair allocation of indivisible goods and chores. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI) (2019)","DOI":"10.24963\/ijcai.2019\/8"},{"issue":"5","key":"22_CR2","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.orl.2020.07.005","volume":"48","author":"H Aziz","year":"2020","unstructured":"Aziz, H., Moulin, H., Sandomirskiy, F.: A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. Oper. Res. Lett. 48(5), 573\u2013578 (2020)","journal-title":"Oper. Res. Lett."},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Rey, S.: Almost group envy-free allocation of indivisible goods and chores. IJCAI (2020)","DOI":"10.24963\/ijcai.2020\/6"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.jet.2014.06.006","volume":"153","author":"Y Azrieli","year":"2014","unstructured":"Azrieli, Y., Shmaya, E.: Rental harmony with roommates. J. Econ. Theory 153, 128\u2013137 (2014)","journal-title":"J. Econ. Theory"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K.: On the proximity of markets with integral equilibria. In: Proceedings of the 33rd Conference on Artificial Intelligence (AAAI) (2019)","DOI":"10.1609\/aaai.v33i01.33011748"},{"key":"22_CR6","unstructured":"Bhaskar, U., Sricharan, A., Vaish, R.: On approximate envy-freeness for indivisible chores and mixed resources (2020). arxiv:2012.06788"},{"issue":"6","key":"22_CR7","doi-asserted-by":"publisher","first-page":"1847","DOI":"10.3982\/ECTA14564","volume":"85","author":"A Bogomolnaia","year":"2017","unstructured":"Bogomolnaia, A., Moulin, H., Sandomirskiy, F., Yanovskaia, E.: Competitive division of a mixed manna. Econometrica 85(6), 1847\u20131871 (2017)","journal-title":"Econometrica"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00355-018-1157-x","volume":"52","author":"A Bogomolnaia","year":"2018","unstructured":"Bogomolnaia, A., Moulin, H., Sandomirskiy, F., Yanovskaia, E.: Dividing bads under additive utilities. Soc. Choice Welf. 52(3), 395\u2013417 (2018). https:\/\/doi.org\/10.1007\/s00355-018-1157-x","journal-title":"Soc. Choice Welf."},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division - From Cake-Cutting to Dispute Resolution. Cambridge University Press, Cambridge (1996)","DOI":"10.1017\/CBO9780511598975"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.): Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781107446984.002"},{"key":"22_CR11","unstructured":"Branzei, S., Sandomirskiy, F.: Algorithms for competitive division of chores (2019). arXiv:1907.01766"},{"key":"22_CR12","unstructured":"Chaudhury, B.R., Garg, J., McGlaughlin, P., Mehta, R.: Dividing bads is harder than dividing goods: on the complexity of fair and efficient division of chores (2020). arxiv:2008.00285"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., McGlaughlin, P., Mehta, R.: Competitive allocation of a mixed manna. In: Proceedings of the 31st Symposium on Discrete Algorithms (SODA) (2021)","DOI":"10.1137\/1.9781611976465.85"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Chen, X., Teng, S.: Spending is not easier than trading: on the computational equivalence of fisher and Arrow-Debreu equilibria. In: Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC), pp. 647\u2013656 (2009)","DOI":"10.1007\/978-3-642-10631-6_66"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Devanur, N., Kannan, R.: Market equilibria in polynomial time for fixed number of goods or agents. In: Proceedings of the 49th Symposium on Foundations of Computer Science (FOCS), pp. 45\u201353 (2008)","DOI":"10.1109\/FOCS.2008.30"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Devanur, N., Papadimitriou, C., Saberi, A., Vazirani, V.: Market equilibrium via a primal-dual algorithm for a convex program. J. ACM 55(5), 1\u201318 (2008)","DOI":"10.1145\/1411509.1411512"},{"key":"22_CR17","unstructured":"Garg, J., McGlaughlin, P.: Computing competitive equilibria with mixed manna. In: Proceedings of the 19th Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 420\u2013428 (2020)"},{"issue":"6","key":"22_CR18","doi-asserted-by":"publisher","first-page":"1820","DOI":"10.1137\/140971002","volume":"44","author":"J Garg","year":"2015","unstructured":"Garg, J., Mehta, R., Sohoni, M., Vazirani, V.V.: A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities. SIAM J. Comput. 44(6), 1820\u20131847 (2015)","journal-title":"SIAM J. Comput."},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Garg, J., V\u00e9gh, L.A.: A strongly polynomial algorithm for linear exchange markets. In: Proceedings of the 51st Symposium on Theory of Computing (STOC) (2019)","DOI":"10.1145\/3313276.3316340"},{"key":"22_CR20","unstructured":"Huang, X., Lu, P.: An algorithmic framework for approximating maximin share allocation of chores (2019). arXiv:1907.04505"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1613\/jair.1.11618","volume":"68","author":"P McGlaughlin","year":"2020","unstructured":"McGlaughlin, P., Garg, J.: Improving Nash social welfare approximations. J. Artif. Intell. Res. 68, 225\u2013245 (2020)","journal-title":"J. Artif. Intell. Res."},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT Press, Cambridge (2003)","DOI":"10.7551\/mitpress\/2954.001.0001"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Nisan, N., Tardos, \u00c9., Roughgarden, T., Vazirani, V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Orlin, J.: Improved algorithms for computing Fisher\u2019s market clearing prices. In: Proceedings of the 42nd Symposium on Theory of Computing (STOC), pp. 291\u2013300 (2010)","DOI":"10.1145\/1806689.1806731"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Robertson, J., Webb, W.: Cake-Cutting Algorithms: Be Fair If You Can. AK Peters, MA (1998)","DOI":"10.1201\/9781439863855"},{"issue":"10","key":"22_CR26","doi-asserted-by":"publisher","first-page":"930","DOI":"10.2307\/2589747","volume":"106","author":"FE Su","year":"1999","unstructured":"Su, F.E.: Rental harmony: sperner\u2019s lemma in fair division. Am. Math. Mon. 106(10), 930\u2013942 (1999)","journal-title":"Am. Math. Mon."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85947-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T03:38:12Z","timestamp":1673235492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85947-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859466","9783030859473"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85947-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 abstracts of presented papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}