arXiv:2601. 17944v2 Announce Type: replace-cross Abstract: We study repeated allocation of shared resources among agents with time-varying demands and capped linear utilities.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
arXiv:2606. 10472v1 Announce Type: cross Abstract: Dynamic multi-resource allocation is a central problem in shared computing environments, where users' demands arrive sequentially and resources must be distributed fairly without knowledge of future demands.
arXiv:2607. 23310v1 Announce Type: cross Abstract: We study an online variant of discrete fair division under generalized assignment budget constraints.
arXiv:2608.24400v1 Announce Type: cross Abstract: We study multilevel fair resource allocation with tree-structured hierarchical relations among agents. At each level, the problem can be viewed local...
The paper investigates the compatibility of envy-freeness and equitability in fair division, focusing on both indivisible goods and chores. It shows that the relaxed notions EF1+EQ1 may not exist even for normalized additive valuations, but provides an algorithm that finds an EF1+EQ1 allocation for up to seven agents with binary goods. For chores, the authors prove that a stronger EFX+EQX guarantee always exists, regardless of normalization, and they also explore cross-notion ex‑ante and ex‑post fairness guarantees.
arXiv:2607. 17311v1 Announce Type: cross Abstract: The problem of fair multi-agent coordination in decentralized settings is one of the most pressing challenges for building efficient collaborative systems.
arXiv:2603. 14372v2 Announce Type: replace Abstract: The rise of AI amplifies the economic phenomenon of \emph{positive spillovers}: when creators contribute content that can be reused and adapted by LLMs, one creator's effort may improve the content quality of others through recombination.