Enabling long-term fairness in dynamic resource allocation

T Si Salem, G Iosifidis, G Neglia - … of the ACM on Measurement and …, 2022 - dl.acm.org
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 …

Bootstrapping Fisher Market Equilibrium and First-Price Pacing Equilibrium

L Liao, C Kroer - Forty-first International Conference on Machine …, 2024 - openreview.net
Linear Fisher market (LFM) is an equilibrium model for fair and efficient resource allocation,
and first-price pacing equilibrium (FPPE) is a model for budget-management in first-price …

Statistical inference and A/B testing for first-price pacing equilibria

L Liao, C Kroer - International Conference on Machine …, 2023 - proceedings.mlr.press
We initiate the study of statistical inference and A/B testing for first-price pacing equilibria
(FPPE). The FPPE model captures the dynamics resulting from large-scale first-price auction …

Learning Fair Division from Bandit Feedback

H Yamada, J Komiyama, K Abe… - … Conference on Artificial …, 2024 - proceedings.mlr.press
This work addresses learning online fair division under uncertainty, where a central planner
sequentially allocates items without precise knowledge of agents' values or utilities …

Statistical inference for fisher market equilibrium

L Liao, Y Gao, C Kroer - arXiv preprint arXiv:2209.15422, 2022 - arxiv.org
Statistical inference under market equilibrium effects has attracted increasing attention
recently. In this paper we focus on the specific case of linear Fisher markets. They have …

Online Fair Allocation with Best-of-Many-Worlds Guarantees

Z Yang, L Liao, Y Gao, C Kroer - arXiv preprint arXiv:2408.02403, 2024 - arxiv.org
We investigate the online fair allocation problem with sequentially arriving items under
various input models, with the goal of balancing fairness and efficiency. We propose the …

Markovian search with socially aware constraints

MR Aminian, V Manshadi, R Niazadeh - arXiv preprint arXiv:2501.13346, 2025 - arxiv.org
We study a general class of sequential search problems for selecting multiple candidates
from different societal groups under" ex-ante constraints" aimed at producing socially …

Fair resource allocation in virtualized O-RAN platforms

F Aslan, G Iosifidis, JA Ayala-Romero… - Proceedings of the …, 2024 - dl.acm.org
O-RAN systems and their deployment in virtualized general-purpose computing platforms (O-
Cloud) constitute a paradigm shift expected to bring unprecedented performance gains …

Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees

Z Yang, L Liao, C Kroer - Proceedings of the AAAI Conference on …, 2024 - ojs.aaai.org
We study an online allocation problem with sequentially arriving items and adversarially
chosen agent values, with the goal of balancing fairness and efficiency. Our goal is to study …

Online Nash Welfare Maximization Without Predictions

Z Huang, M Li, X Shu, T Wei - … Conference on Web and Internet Economics, 2023 - Springer
The maximization of Nash welfare, which equals the geometric mean of agents' utilities, is
widely studied because it balances efficiency and fairness in resource allocation problems …