Fair and Efficient Allocation of Indivisible Chores with Surplus

Akrami, Hannaneh; Ray Chaudhury, Bhaskar; Garg, Jugal; Mehlhorn, Kurt; Mehta, Ruta

doi:10.24963/ijcai.2023/277

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Fair and Efficient Allocation of Indivisible Chores with Surplus

MPS-Authors

/persons/resource/persons263365

Akrami, Hannaneh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://www.ijcai.org/proceedings/2023/277
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Akrami, H., Ray Chaudhury, B., Garg, J., Mehlhorn, K., & Mehta, R. (2023). Fair and Efficient Allocation of Indivisible Chores with Surplus. In E. Elkind (Ed.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (pp. 2494-2502). IJCAI. doi:10.24963/ijcai.2023/277.

Cite as: https://hdl.handle.net/21.11116/0000-000F-1425-1

Abstract

There is no abstract available