arXiv:2608. 03171v1 Announce Type: cross Abstract: We study fair allocations of indivisible goods among agents with heterogeneous monotone valuations.
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:2406. 12413v3 Announce Type: replace-cross Abstract: We study the problem of allocating a set of indivisible goods to a set of agents with additive valuation functions, aiming to achieve approximate envy-freeness up to any good ($\alpha$-EFX).
arXiv:2607. 23367v1 Announce Type: cross Abstract: We study whether strictly positive marginal values restore the compatibility of envy-freeness up to one good (EF1) and Pareto optimality (PO) for indivisible goods.
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: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...
arXiv:2607. 23310v1 Announce Type: cross Abstract: We study an online variant of discrete fair division under generalized assignment budget constraints.
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.