arXiv:2606. 18679v1 Announce Type: cross Abstract: We study the problem of fair online resource allocation, motivated by applications such as refugee resettlement and airline scheduling, where agents arrive sequentially and must be assigned to facilities with limited capacities.
Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.
arXiv:2607. 23310v1 Announce Type: cross Abstract: We study an online variant of discrete fair division under generalized assignment budget constraints.
arXiv:2605. 01961v2 Announce Type: replace Abstract: Learning from human preference data is becoming a useful tool, from fine-tuning large language models to training reinforcement learning agents.
arXiv:2601. 07144v3 Announce Type: replace-cross Abstract: Ensuring fairness in matching algorithms is a key challenge in allocating scarce resources and positions.
arXiv:2607. 23772v1 Announce Type: cross Abstract: We study a restless multi-armed bandit (RMAB) problem for a stochastic deadline scheduling application.
arXiv:2606. 05380v1 Announce Type: cross Abstract: We present learning-augmented algorithms for two general classes of online minimization problems: metrical task systems and laminar set cover.
arXiv:2607. 26485v1 Announce Type: cross Abstract: Resource allocation across multiple agent groups arises in many applications including e-commerce recommendation systems, housing assignment, and course allocation, and is commonly formulated as an optimization problem with diversity constraints to ensure group fairness.