IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i16p3616-d1221675.html
   My bibliography  Save this article

A Survey on Fair Allocation of Chores

Author

Listed:
  • Hao Guo

    (School of Mathematics and Statistics, Yunnan University, Kunming 650504, China)

  • Weidong Li

    (School of Mathematics and Statistics, Yunnan University, Kunming 650504, China)

  • Bin Deng

    (School of Mathematics and Statistics, Yunnan University, Kunming 650504, China)

Abstract

Wherever there is group life, there has been a social division of labor and resource allocation, since ancient times. Examples include ant colonies, bee colonies, and wolf colonies. Different roles are responsible for different tasks. The same is true of human beings. Human beings are the largest social group in nature, among whom there are intricate social networks and interest networks between individuals. In such a complex relationship, how do decision makers allocate resources or tasks to individuals in a fair way? This is a topic worthy of further study. In recent decades, fair allocation has been at the core of research in economics, mathematics and other fields. The fair allocation problem is to assign a set of items to a set of agents so that each agent’s allocation is as fair as possible to satisfy each agent. The fairness measurements followed in current research include envy-freeness, proportionality, equitability, maximin share fairness, competitive equilibrium, maximum Nash social diswelfare, and so on. In this paper, the main concern is the allocation of chores. We discuss this problem in two parts: divisible and indivisible. We comprehensively review the existing results, algorithms, and approximations that meet various fairness criteria in chronological order. The relevant results of achieving fairness and efficiency are also discussed. In addition, we propose some open questions and future research directions for this problem based on existing research.

Suggested Citation

  • Hao Guo & Weidong Li & Bin Deng, 2023. "A Survey on Fair Allocation of Chores," Mathematics, MDPI, vol. 11(16), pages 1-28, August.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:16:p:3616-:d:1221675
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/16/3616/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/16/3616/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. William C. Brainard & Herbert E. Scarf, 2005. "How to Compute Equilibrium Prices in 1891," American Journal of Economics and Sociology, Wiley Blackwell, vol. 64(1), pages 57-83, January.
    2. Camacho, Franklin & Fonseca-Delgado, Rigoberto & Pino Pérez, Ramón & Tapia, Guido, 2023. "Generalized binary utility functions and fair allocations," Mathematical Social Sciences, Elsevier, vol. 121(C), pages 50-60.
    3. Anna Bogomolnaia & Hervé Moulin & Fedor Sandomirskiy & Elena Yanovskaya, 2017. "Competitive Division of a Mixed Manna," Econometrica, Econometric Society, vol. 85(6), pages 1847-1871, November.
    4. Ernst Fehr & Klaus M. Schmidt, 1999. "A Theory of Fairness, Competition, and Cooperation," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 114(3), pages 817-868.
    5. Simina Br^anzei & Fedor Sandomirskiy, 2019. "Algorithms for Competitive Division of Chores," Papers 1907.01766, arXiv.org, revised Jul 2023.
    6. Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061-1103.
    7. Berliant, Marcus & Thomson, William & Dunz, Karl, 1992. "On the fair division of a heterogeneous commodity," Journal of Mathematical Economics, Elsevier, vol. 21(3), pages 201-216.
    8. Klaus Jansen & Kim-Manuel Klein & José Verschae, 2020. "Closing the Gap for Makespan Scheduling via Sparsification Techniques," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1371-1392, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Anna Bogomolnaia & Hervé Moulin, 2023. "Guarantees in Fair Division: General or Monotone Preferences," Mathematics of Operations Research, INFORMS, vol. 48(1), pages 160-176, February.
    2. Ortega, Josué, 2020. "Multi-unit assignment under dichotomous preferences," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 15-24.
    3. Soroush Ebadian & Dominik Peters & Nisarg Shah, 2022. "How to Fairly Allocate Easy and Difficult Chores," Post-Print hal-03834514, HAL.
    4. Fedor Sandomirskiy & Erel Segal-Halevi, 2019. "Efficient Fair Division with Minimal Sharing," Papers 1908.01669, arXiv.org, revised Apr 2022.
    5. Simina Br^anzei & Fedor Sandomirskiy, 2019. "Algorithms for Competitive Division of Chores," Papers 1907.01766, arXiv.org, revised Jul 2023.
    6. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
    7. Erel Segal-Halevi, 2019. "Fair Division with Bounded Sharing," Papers 1912.00459, arXiv.org.
    8. Jalota, Devansh & Pavone, Marco & Qi, Qi & Ye, Yinyu, 2023. "Fisher markets with linear constraints: Equilibrium properties and efficient distributed algorithms," Games and Economic Behavior, Elsevier, vol. 141(C), pages 223-260.
    9. Erel Segal-Halevi & Shmuel Nitzan, 2019. "Fair cake-cutting among families," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 53(4), pages 709-740, December.
    10. Erel Segal-Halevi & Balázs R. Sziklai, 2019. "Monotonicity and competitive equilibrium in cake-cutting," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(2), pages 363-401, September.
    11. Vittorio Bil`o & Ioannis Caragiannis & Michele Flammini & Ayumi Igarashi & Gianpiero Monaco & Dominik Peters & Cosimo Vinci & William S. Zwicker, 2018. "Almost Envy-Free Allocations with Connected Bundles," Papers 1808.09406, arXiv.org, revised May 2022.
    12. Anna Bogomolnaia & Hervé Moulin & Fedor Sandomirskiy & Elena Yanovskaia, 2019. "Dividing bads under additive utilities," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 52(3), pages 395-417, March.
    13. Camacho, Franklin & Fonseca-Delgado, Rigoberto & Pino Pérez, Ramón & Tapia, Guido, 2023. "Generalized binary utility functions and fair allocations," Mathematical Social Sciences, Elsevier, vol. 121(C), pages 50-60.
    14. Segal-Halevi, Erel & Nitzan, Shmuel & Hassidim, Avinatan & Aumann, Yonatan, 2017. "Fair and square: Cake-cutting in two dimensions," Journal of Mathematical Economics, Elsevier, vol. 70(C), pages 1-28.
    15. Rosner, Shaul & Tamir, Tami, 2023. "Scheduling games with rank-based utilities," Games and Economic Behavior, Elsevier, vol. 140(C), pages 229-252.
    16. Aziz, Haris & Huang, Xin & Mattei, Nicholas & Segal-Halevi, Erel, 2023. "Computing welfare-Maximizing fair allocations of indivisible goods," European Journal of Operational Research, Elsevier, vol. 307(2), pages 773-784.
    17. Moshe Babaioff & Noam Nisan & Inbal Talgam-Cohen, 2021. "Competitive Equilibrium with Indivisible Goods and Generic Budgets," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 382-403, February.
    18. Jonathan Scarlett & Nicholas Teh & Yair Zick, 2023. "For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods," Papers 2302.06958, arXiv.org.
    19. Krist'of B'erczi & Erika R. B'erczi-Kov'acs & Endre Boros & Fekadu Tolessa Gedefa & Naoyuki Kamiyama & Telikepalli Kavitha & Yusuke Kobayashi & Kazuhisa Makino, 2020. "Envy-free Relaxations for Goods, Chores, and Mixed Items," Papers 2006.04428, arXiv.org.
    20. Erel Segal-Halevi & Shmuel Nitzan, 2014. "Cake Cutting – Fair and Square," Working Papers 2014-01, Bar-Ilan University, Department of Economics.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:16:p:3616-:d:1221675. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.