Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents

Tianze Wei; Bo Li; Minming Li

doi:10.24963/ijcai.2023/323

Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

1 Citation (Scopus)

Abstract

The real-world deployment of fair allocation algorithms usually involves a heterogeneous population of users, which makes it challenging for the users to get complete knowledge of the allocation except for their own bundles. Recently, a new fairness notion, maximin-awareness (MMA) was proposed and it guarantees that every agent is not the worst-off one, no matter how the items that are not allocated to this agent are distributed. We adapt and generalize this notion to the case of indivisible chores and when the agents may have arbitrary weights. Due to the inherent difficulty of MMA, we also consider its up to one and up to any relaxations. A string of results on the existence and computation of MMA related fair allocations, and their connections to existing fairness concepts is given. © 2023 International Joint Conferences on Artificial Intelligence.

Original language	English
Title of host publication	Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23)
Editors	Edith Elkind
Publisher	International Joint Conferences on Artificial Intelligence
Pages	2897-2905
Number of pages	9
ISBN (Electronic)	9781956792034
DOIs	https://doi.org/10.24963/ijcai.2023/323
Publication status	Published - Aug 2023
Event	32nd International Joint Conference on Artificial Intelligence (IJCAI 2023) - Sheraton Grand Macao, Macao, China Duration: 19 Aug 2023 → 25 Aug 2023 https://ijcai-23.org/

Publication series

Name	IJCAI International Joint Conference on Artificial Intelligence
Volume	2023-August
ISSN (Print)	1045-0823

Conference

Conference	32nd International Joint Conference on Artificial Intelligence (IJCAI 2023)
Abbreviated title	IJCAI-23
Place	Macao, China
Period	19/08/23 → 25/08/23
Internet address	https://ijcai-23.org/

Funding

Bo Li is supported by NSFC under Grant No. 62102333, HKSAR RGC under Grant No. PolyU 25211321, and CCF-Huawei Populus Grove Fund. Minming Li is supported by the Fundamental Research Funds for the Central Universities. Bo Li is supported by NSFC under Grant No. 62102333, HKSAR RGC under Grant No. PolyU 25211321, and CCFHuawei Populus Grove Fund. Minming Li is supported by the Fundamental Research Funds for the Central Universities.

RGC Funding Information

RGC-funded

Access Output

10.24963/ijcai.2023/323

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Wei, T., Li, B., & Li, M. (2023). Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents. In E. Elkind (Ed.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23) (pp. 2897-2905). (IJCAI International Joint Conference on Artificial Intelligence; Vol. 2023-August). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/323

Wei, Tianze ; Li, Bo ; Li, Minming. / Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23). editor / Edith Elkind. International Joint Conferences on Artificial Intelligence, 2023. pp. 2897-2905 (IJCAI International Joint Conference on Artificial Intelligence).

@inproceedings{a296b22f6ca5401fbecee5db42be5f86,

title = "Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents",

abstract = "The real-world deployment of fair allocation algorithms usually involves a heterogeneous population of users, which makes it challenging for the users to get complete knowledge of the allocation except for their own bundles. Recently, a new fairness notion, maximin-awareness (MMA) was proposed and it guarantees that every agent is not the worst-off one, no matter how the items that are not allocated to this agent are distributed. We adapt and generalize this notion to the case of indivisible chores and when the agents may have arbitrary weights. Due to the inherent difficulty of MMA, we also consider its up to one and up to any relaxations. A string of results on the existence and computation of MMA related fair allocations, and their connections to existing fairness concepts is given. {\textcopyright} 2023 International Joint Conferences on Artificial Intelligence.",

author = "Tianze Wei and Bo Li and Minming Li",

year = "2023",

month = aug,

doi = "10.24963/ijcai.2023/323",

language = "English",

series = "IJCAI International Joint Conference on Artificial Intelligence",

publisher = "International Joint Conferences on Artificial Intelligence",

pages = "2897--2905",

editor = "Edith Elkind",

booktitle = "Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23)",

note = "32nd International Joint Conference on Artificial Intelligence (IJCAI 2023), IJCAI-23 ; Conference date: 19-08-2023 Through 25-08-2023",

url = "https://ijcai-23.org/",

}

Wei, T, Li, B & Li, M 2023, Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents. in E Elkind (ed.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23). IJCAI International Joint Conference on Artificial Intelligence, vol. 2023-August, International Joint Conferences on Artificial Intelligence, pp. 2897-2905, 32nd International Joint Conference on Artificial Intelligence (IJCAI 2023), Macao, China, 19/08/23. https://doi.org/10.24963/ijcai.2023/323

Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents. / Wei, Tianze; Li, Bo; Li, Minming.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23). ed. / Edith Elkind. International Joint Conferences on Artificial Intelligence, 2023. p. 2897-2905 (IJCAI International Joint Conference on Artificial Intelligence; Vol. 2023-August).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents

AU - Wei, Tianze

AU - Li, Bo

AU - Li, Minming

PY - 2023/8

Y1 - 2023/8

N2 - The real-world deployment of fair allocation algorithms usually involves a heterogeneous population of users, which makes it challenging for the users to get complete knowledge of the allocation except for their own bundles. Recently, a new fairness notion, maximin-awareness (MMA) was proposed and it guarantees that every agent is not the worst-off one, no matter how the items that are not allocated to this agent are distributed. We adapt and generalize this notion to the case of indivisible chores and when the agents may have arbitrary weights. Due to the inherent difficulty of MMA, we also consider its up to one and up to any relaxations. A string of results on the existence and computation of MMA related fair allocations, and their connections to existing fairness concepts is given. © 2023 International Joint Conferences on Artificial Intelligence.

AB - The real-world deployment of fair allocation algorithms usually involves a heterogeneous population of users, which makes it challenging for the users to get complete knowledge of the allocation except for their own bundles. Recently, a new fairness notion, maximin-awareness (MMA) was proposed and it guarantees that every agent is not the worst-off one, no matter how the items that are not allocated to this agent are distributed. We adapt and generalize this notion to the case of indivisible chores and when the agents may have arbitrary weights. Due to the inherent difficulty of MMA, we also consider its up to one and up to any relaxations. A string of results on the existence and computation of MMA related fair allocations, and their connections to existing fairness concepts is given. © 2023 International Joint Conferences on Artificial Intelligence.

UR - http://www.scopus.com/inward/record.url?scp=85170353568&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0- 85170353568&origin=recordpage

U2 - 10.24963/ijcai.2023/323

DO - 10.24963/ijcai.2023/323

M3 - RGC 32 - Refereed conference paper (with host publication)

AN - SCOPUS:85170353568

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 2897

EP - 2905

BT - Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23)

A2 - Elkind, Edith

PB - International Joint Conferences on Artificial Intelligence

T2 - 32nd International Joint Conference on Artificial Intelligence (IJCAI 2023)

Y2 - 19 August 2023 through 25 August 2023

ER -

Wei T, Li B, Li M. Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents. In Elkind E, editor, Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23). International Joint Conferences on Artificial Intelligence. 2023. p. 2897-2905. (IJCAI International Joint Conference on Artificial Intelligence). doi: 10.24963/ijcai.2023/323

Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents

Abstract

Publication series

Conference

Funding

RGC Funding Information

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this