Promoting External and Internal Equities Under Ex-Ante/Ex-Post Metrics in Online Resource Allocation
Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Abstract
This paper proposes two different models for equitable resource allocation in online settings. The first one is called external equity promotion, where sequentially arriving agents are heterogeneous in their external attributes, namely how many resources they demand, which are drawn from a probability distribution (accessible to the algorithm). The focus is then to devise an allocation policy such that every requester can get a fair share of resources proportional to their demands, regardless of their arrival time. The second is called internal equity promotion, where arriving requesters can be treated homogeneously in external attributes (demands) but are heterogeneous in internal traits such as demographics. In particular, each requester can be identified as belonging to one or several groups, and an allocation of resources is regarded as equitable when every group of requesters can receive a fair share of resources proportional to the percentage of that group in the whole population. For both models above, we consider as the benchmark a clairvoyant optimal solution that has the privilege to access all random demand realizations in advance. We consider two equity metrics, namely ex-post and ex-ante, and discuss the challenges under the two metrics in detail. Specifically, we present two linear program (LP)-based policies for external equity promotion under ex-ante with independent demands, each achieving an optimal CR of 1/2 with respect to the benchmark LP. For internal equity promotion, we present optimal policies under both ex-ante and ex-post metrics.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d04af235-e236-4677-85dc-84b2e5169c92Builds on7
- Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand HoursVedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson et al.AAAI 2020 · 73 citations
- Regularized Online Allocation Problems: Fairness and BeyondSantiago R. Balseiro, Haihao Lu, Vahab S. MirrokniICML 2021 · 67 citations
- Fair and Efficient Online Allocations with Normalized ValuationsVasilis Gkatzelis, Alexandros Psomas, Xizhi TanAAAI 2021 · 26 citations
- Group-Fair Online Allocation in Continuous TimeSemih Cayci, Swati Gupta, Atilla EryilmazNeurIPS 2020 · 23 citations
- Class Fairness in Online MatchingHadi Hosseini, Zhiyi Huang, Ayumi Igarashi, Nisarg ShahAAAI 2023 · 21 citations
Related papers
- Equity Promotion in Online Resource AllocationPan Xu, Yifan XuAAAI 2022 · 4 citations
- Promoting Fairness Among Dynamic Agents in Online-Matching Markets under Known Stationary Arrival DistributionsWill Ma, Pan XuNeurIPS 2024 · 5 citations
- No-regret Algorithms for Fair Resource AllocationAbhishek Sinha, Ativ Joshi, Rajarshi Bhattacharjee, Cameron Musco et al.NeurIPS 2023 · 14 citations
- Online Market Equilibrium with Application to Fair DivisionYuan Gao, Alex Peysakhovich, Christian KroerNeurIPS 2021 · 35 citations
- Fairness and Bias in Online SelectionJosé Correa, Andrés Cristi, Paul Duetting, Ashkan Norouzi-FardICML 2021
