A Reduction from Chores Allocation to Job Scheduling

Xin Huang, Erel Segal-Halevi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

We consider allocating indivisible chores among agents with different cost functions, such that all agents receive a cost of at most a constant factor times their maximin share.

Original languageEnglish
Title of host publicationEC 2023 - Proceedings of the 24th ACM Conference on Economics and Computation
PublisherAssociation for Computing Machinery, Inc
Pages908
Number of pages1
ISBN (Electronic)9798400701047
DOIs
StatePublished - 9 Jul 2023
Externally publishedYes
Event24th ACM Conference on Economics and Computation, EC 2023 - London, United Kingdom
Duration: 9 Jul 202312 Jul 2023

Publication series

NameEC 2023 - Proceedings of the 24th ACM Conference on Economics and Computation

Conference

Conference24th ACM Conference on Economics and Computation, EC 2023
Country/TerritoryUnited Kingdom
CityLondon
Period9/07/2312/07/23

Bibliographical note

Publisher Copyright:
© 2023 Owner/Author(s).

Funding

Xin Huang is supported in part at the Technion by an Aly Kaufman Fellowship. Erel Segal-Halevi is supported by the Israel Science Foundation (grant no. 712/20). We are grateful to the reviewers of EC 2023 for their helpful comments.

FundersFunder number
Israel Science Foundation712/20

    Fingerprint

    Dive into the research topics of 'A Reduction from Chores Allocation to Job Scheduling'. Together they form a unique fingerprint.

    Cite this