Work

An Algorithmic Framework for Approximating Maximin Share Allocation of Chores

Year: 2021

Type: conference-paper

Abstract: We consider the problem of fairly dividing m indivisible chores among n agents. The fairness measure we consider here is the maximin share. The previous best known result is that there always exists a 4/3-approximation maximin share allocation[3]. With our algorithm, we can always find a 11/9-approximation maximin share allocation for any instance. We also discuss how to improve the efficiency of the algorithm and its connection to the job scheduling problem. The full paper can be found at https://arxiv.org/abs/1907.04505.

Source: ACM Conference on Economics and Computation (EC)

DOI: 10.1145/3465456.3467555

Authors: Xin Huang, Pinyan Lu

Institutions: Technion – Israel Institute of Technology, Shanghai University of Finance and Economics

Language: English

Topic: Game Theory and Voting Systems

Subfield: Economics and Econometrics

Field: Economics, Econometrics and Finance

Domain: Social Sciences

Open Access status: green

Funders: National Natural Science Foundation of China, Shanghai Municipal Education Commission, Shanghai University of Finance and Economics, Fundamental Research Funds for the Central Universities

Awards: G8939654172, G974371836