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

Max–Min Share-Based Mechanism for Multi-Resource Fair Allocation with Bounded Number of Tasks in Cloud Computing System

Author

Listed:
  • Jie Li

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650504, China
    Yunnan Key Laboratory of Computer Technology Application, Kunming University of Science and Technology, Kunming 650504, China)

  • Haoyu Wang

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650504, China
    Yunnan Key Laboratory of Computer Technology Application, Kunming University of Science and Technology, Kunming 650504, China)

  • Jianzhou Wang

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650504, China
    Yunnan Key Laboratory of Computer Technology Application, Kunming University of Science and Technology, Kunming 650504, China)

  • Yue Zhang

    (City College, Kunming University of Science and Technology, Kunming 650504, China)

Abstract

Finding a fair and efficient multi-resource allocation is a fundamental goal in cloud computing systems. In this paper, we consider the problem of multi-resource allocation with a bounded number of tasks. We propose a lexicographic max–min maximin share (LMM-MMS) fair allocation mechanism and design a non-trivial polynomial-time algorithm to find an LMM-MMS solution. In addition, we prove that LMM-MMS satisfies Pareto efficiency, sharing incentive, envy-freeness, and group strategy-proofness properties. The experimental results showed that LMM-MMS could produce a fair allocation with a higher resource utilization and completion ratio of user jobs than previous known fair mechanisms; LMM-MMS also performed well in resource sharing.

Suggested Citation

  • Jie Li & Haoyu Wang & Jianzhou Wang & Yue Zhang, 2025. "Max–Min Share-Based Mechanism for Multi-Resource Fair Allocation with Bounded Number of Tasks in Cloud Computing System," Mathematics, MDPI, vol. 13(13), pages 1-17, July.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:13:p:2214-:d:1696508
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/13/2214/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/13/2214/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    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. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
    2. Aygün, Orhan & Turhan, Bertan, 2021. "How to De-reserve Reserves," ISU General Staff Papers 202103100800001123, Iowa State University, Department of Economics.
    3. Parag A. Pathak & Alex Rees-Jones & Tayfun Sönmez, 2025. "Immigration Lottery Design: Engineered and Coincidental Consequences of H-1B Reforms," The Review of Economics and Statistics, MIT Press, vol. 107(1), pages 1-13, January.
    4. Eric Budish & Gérard P. Cachon & Judd B. Kessler & Abraham Othman, 2017. "Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation," Operations Research, INFORMS, vol. 65(2), pages 314-336, April.
    5. 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.
    6. Dur, Umut Mert & Wiseman, Thomas, 2019. "School choice with neighbors," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 101-109.
    7. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    8. Ortega, Josué, 2020. "Multi-unit assignment under dichotomous preferences," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 15-24.
    9. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    10. Wu, Haoyu & Tang, Ao, 2024. "An even tighter bound for the Shapley–Folkman–Starr theorem," Journal of Mathematical Economics, Elsevier, vol. 114(C).
    11. Antonio Romero-Medina & Matteo Triossi, 2017. "(Group) Strategy-proofness and stability in many-to many marching markets," Documentos de Trabajo 332, Centro de Economía Aplicada, Universidad de Chile.
    12. Piotr Dworczak & Scott Duke Kominers & Mohammad Akbarpour, 2021. "Redistribution Through Markets," Econometrica, Econometric Society, vol. 89(4), pages 1665-1698, July.
    13. Ezzat Elokda & Saverio Bolognani & Andrea Censi & Florian Dörfler & Emilio Frazzoli, 2024. "A Self-Contained Karma Economy for the Dynamic Allocation of Common Resources," Dynamic Games and Applications, Springer, vol. 14(3), pages 578-610, July.
    14. Budish, Eric & Reny, Philip J., 2020. "An improved bound for the Shapley–Folkman theorem," Journal of Mathematical Economics, Elsevier, vol. 89(C), pages 48-52.
    15. Hadi Hosseini, 2023. "The Fairness Fair: Bringing Human Perception into Collective Decision-Making," Papers 2312.14402, arXiv.org.
    16. Nikhil Agarwal & Eric Budish, 2021. "Market Design," NBER Working Papers 29367, National Bureau of Economic Research, Inc.
    17. Tierney, Ryan, 2019. "The problem of multiple commons: A market design approach," Games and Economic Behavior, Elsevier, vol. 114(C), pages 1-27.
    18. Jamie Tucker-Foltz & Richard Zeckhauser, 2022. "Playing Divide-and-Choose Given Uncertain Preferences," Papers 2207.03076, arXiv.org, revised Oct 2024.
    19. 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.
    20. Anna Bogomolnaia & Ron Holzman & Hervé Moulin, 2021. "Worst Case in Voting and Bargaining," Post-Print halshs-03196999, HAL.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:13:y:2025:i:13:p:2214-:d:1696508. 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.