2 papers
cs.GT2024
Online Fair Allocation with Best-of-Many-Worlds Guarantees
Zongjun Yang, Luofeng Liao, Yuan Gao +1
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 un…
cs.GT2023
Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees
Zongjun Yang, Luofeng Liao, Christian Kroer
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 stu…