论文标题
在动态资源分配中实现长期公平性
Enabling Long-term Fairness in Dynamic Resource Allocation
论文作者
论文摘要
我们研究了$α$ fairness标准下的动态资源分配问题的公平性。我们认识到在这个问题中自然出现的两个不同的公平目标：旨在确保每个时段的公平性的良好理解的老虎机目标，以及较少探索的地平线目标目标，旨在确保跨时间范围内积累的公平性。我们认为，就社会福利而言，Horizon-Fairness的价格较低。我们以遗憾作为表演指标来学习地平线，并表明在不受限制的对手面前无法实现消失的遗憾。我们提出了对对手的能力的限制，该功能与现实情况和在线政策相对应，该政策确实保证了这些限制下的遗憾消失。我们证明了拟议的公平框架对代表性资源管理问题的适用性，考虑到虚拟化的缓存系统，在该系统中，不同的缓存配合以服务于内容请求。
We study the fairness of dynamic resource allocation problem under the $α$-fairness criterion. We recognize two different fairness objectives that naturally arise in this problem: the well-understood slot-fairness objective that aims to ensure fairness at every timeslot, and the less explored horizon-fairness objective that aims to ensure fairness across utilities accumulated over a time horizon. We argue that horizon-fairness comes at a lower price in terms of social welfare. We study horizon-fairness with the regret as a performance metric and show that vanishing regret cannot be achieved in presence of an unrestricted adversary. We propose restrictions on the adversary's capabilities corresponding to realistic scenarios and an online policy that indeed guarantees vanishing regret under these restrictions. We demonstrate the applicability of the proposed fairness framework to a representative resource management problem considering a virtualized caching system where different caches cooperate to serve content requests.
