research-article

Maxmin Share Fair Allocation of Indivisible Chores to Asymmetric Agents

Authors:

Haris Aziz,

Hau Chan,

Bo LiAuthors Info & Claims

AAMAS '19: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems

Pages 1787 - 1789

Published: 08 May 2019 Publication History

Get Access

Abstract

We initiate the study of indivisible chore allocation for agents with asymmetric shares. The fairness concepts we focus on are natural generalizations of maxmin share: WMMS fairness and OWMMS fairness. We first highlight the fact that commonly-used algorithms that work well for allocation of goods to asymmetric agents, and even for chores to symmetric agents do not provide good approximations for allocation of chores to asymmetric agents under WMMS. As a consequence, we present a novel polynomial-time constant-approximation algorithm, via linear program, for OWMMS. For two special cases: binary valuation case and 2-agent case, we provide exact or better constant-approximation algorithms.

References

[1]

G. Amanatidis, E. Markakis, A. Nikzad, and A. Saberi. 2015. Approximation Algorithms for Computing Maximin Share Allocations. In Proceedings of the 35th International Colloquium on Automata, Languages, and Programming (ICALP). 39--51.

Google Scholar

[2]

H. Aziz. 2016. Computational Social Choice: Some Current and New Directions. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI). 4054--4057.

Digital Library

Google Scholar

[3]

H. Aziz, G. Rauchecker, G. Schryen, and T. Walsh. 2017. Algorithms for Max-Min Share Fair Allocation of Indivisible Chores. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI). 335--341.

Digital Library

Google Scholar

[4]

S. Barman and S. Kumar Krishna Murthy. 2017. Approximation Algorithms for Maximin Fair Division. In Proceedings of the 18th ACM Conference on Economics and Computation (ACM-EC). 647--664.

Digital Library

Google Scholar

[5]

E. Budish. 2011. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes. Journal of Political Economy, Vol. 119, 6 (2011), 1061--1103.

Crossref

Google Scholar

[6]

A. Farhadi, M. Hajiaghayi, M. Ghodsi, S. Lahaie, D. M. Pennock, M. Seddighin, S. Seddighin, and H. Yami. 2017. Fair Allocation of Indivisible Goods to Asymmetric Agents. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, S a o Paulo, Brazil, May 8--12, 2017. 1535--1537.

Digital Library

Google Scholar

[7]

A. Farhadi, M. Hajiaghayi, M. Ghodsi, S. Lahaie, D. M. Pennock, M. Seddighin, S. Seddighin, and H. Yami. 2019. Fair Allocation of Indivisible Goods to Asymmetric Agents. Journal of Artifical Intelligence Research (JAIR) (2019).

Google Scholar

[8]

D. Friesen. 1987. Tighter bounds for LPT scheduling on uniform processors. SIAM J. Comput., Vol. 16, 3 (1987), 554--560.

Digital Library

Google Scholar

[9]

M. Ghodsi, M. HajiAghayi, M. Seddighin, S. Seddighin, and H. Yami. 2018. Fair allocation of indivisible goods: Improvements and generalizations. In Proceedings of the 19th ACM Conference on Economics and Computation (ACM-EC). ACM Press.

Digital Library

Google Scholar

[10]

T. Gonzalez, O. Ibarra, and S. Sahni. 1977. Bounds for LPT schedules on uniform processors. SIAM J. Comput., Vol. 6, 1 (1977), 155--166.

Digital Library

Google Scholar

[11]

J. Lenstra, D. Shmoys, and E. Tardos. 1990. Approximation algorithms for scheduling unrelated parallel machines. Mathematical programming, Vol. 46, 1--3 (1990), 259--271.

Digital Library

Google Scholar

[12]

A. D. Procaccia and J. Wang. 2014. Fair Enough: Guaranteeing Approximate Maximin Shares. In Proceedings of the 15th ACM Conference on Economics and Computation (ACM-EC). ACM Press, 675--692.

Digital Library

Google Scholar

Cited By

View all

Sun AChen BVinh Doan XDignum FLomuscio AEndriss UNowé A(2021)Connections between Fairness Criteria and Efficiency for Allocating Indivisible ChoresProceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3463952.3464100(1281-1289)Online publication date: 3-May-2021
https://dl.acm.org/doi/10.5555/3463952.3464100
Chaudhury BGarg JMcGlaughlin PMehta RMarx D(2021)Competitive allocation of a mixed mannaProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458149(1405-1424)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458149

Index Terms

Maxmin Share Fair Allocation of Indivisible Chores to Asymmetric Agents
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis

Recommendations

Fair Division of Indivisible Goods Among Strategic Agents
AAMAS '19: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems

We study fair division of indivisible goods among strategic agents in a single-parameter environment. This work specifically considers fairness in terms of envy freeness up to one good (EF1) and maximin share guarantee (MMS). We show that (in a single-...
EFX Allocations for Indivisible Chores: Matching-Based Approach
Algorithmic Game Theory
Abstract
One of the most important topics in discrete fair division is whether an EFX allocation exists for any instance. Although the existence of EFX allocations is a standing open problem for both goods and chores, the understanding of the existence of ...
Fair Allocation of Two Types of Chores
AAMAS '23: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems

We consider the problem of fair allocation of indivisible chores under additive valuations. We assume that the chores are divided into two types and under this scenario, we present several results. Our first result is a new characterization of Pareto ...

Comments

Information & Contributors

Information

Published In

AAMAS '19: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems

May 2019

2518 pages

ISBN:9781450363099

General Chairs:
Edith Elkind
University of Oxford, UK
,
Manuela Veloso
CMU (on leave), JPMorgan, USA
,
Program Chairs:
Noa Agmon
Bar-Ilan University, Israel
,
Matthew E. Taylor
Borealis AI, Canada

Publisher

International Foundation for Autonomous Agents and Multiagent Systems

Richland, SC

Publication History

Published: 08 May 2019

Check for updates

Author Tags

Qualifiers

Research-article

Conference

AAMAS '19

Sponsor:

SIGAI

AAMAS '19: International Conference on Autonomous Agents and Multiagent Systems

May 13 - 17, 2019

Montreal QC, Canada

Acceptance Rates

AAMAS '19 Paper Acceptance Rate 193 of 793 submissions, 24%;

Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
62
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sun AChen BVinh Doan XDignum FLomuscio AEndriss UNowé A(2021)Connections between Fairness Criteria and Efficiency for Allocating Indivisible ChoresProceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3463952.3464100(1281-1289)Online publication date: 3-May-2021
https://dl.acm.org/doi/10.5555/3463952.3464100
Chaudhury BGarg JMcGlaughlin PMehta RMarx D(2021)Competitive allocation of a mixed mannaProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458149(1405-1424)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458149

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Fair Division of Indivisible Goods Among Strategic Agents

EFX Allocations for Indivisible Chores: Matching-Based Approach

Fair Allocation of Two Types of Chores

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Fair Division of Indivisible Goods Among Strategic Agents

EFX Allocations for Indivisible Chores: Matching-Based Approach

Fair Allocation of Two Types of Chores

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations