Karma: Resource Allocation for Dynamic Demands
Midhul Vuppalapati, Giannis Fikioris, Rachit Agarwal, Asaf Cidon,, Anurag Khandelwal, Eva Tardos

TL;DR
Karma is a novel resource allocation mechanism designed for systems with dynamic user demands, ensuring fairness, efficiency, and strategy-proofness through a credit-based algorithm that adapts to changing demands.
Contribution
This paper introduces Karma, a new credit-based resource allocation mechanism that maintains fairness and efficiency under dynamic user demands, unlike classical static algorithms.
Findings
Karma reduces performance disparity among users.
Karma maintains Pareto-optimal system-wide performance.
Karma guarantees fairness and strategy-proofness in practice.
Abstract
We consider the problem of fair resource allocation in a system where user demands are dynamic, that is, where user demands vary over time. Our key observation is that the classical max-min fairness algorithm for resource allocation provides many desirable properties (e.g., Pareto efficiency, strategy-proofness, and fairness), but only under the strong assumption of user demands being static over time. For the realistic case of dynamic user demands, the max-min fairness algorithm loses one or more of these properties. We present Karma, a new resource allocation mechanism for dynamic user demands. The key technical contribution in Karma is a credit-based resource allocation algorithm: in each quantum, users donate their unused resources and are assigned credits when other users borrow these resources; Karma carefully orchestrates the exchange of credits across users (based on their…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCloud Computing and Resource Management · Economic theories and models
