arXiv:2609. 03846v1 Announce Type: cross Abstract: We study the allocation of indivisible goods among agents with identical additive valuations, focusing on envy-freeness up to one good (EF1) and Nash social welfare (NSW).
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. 23310v1 Announce Type: cross Abstract: We study an online variant of discrete fair division under generalized assignment budget constraints.
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. 11146v1 Announce Type: new Abstract: We study the coupled objective J_K^WOR = E_{S ~ PL-WOR_K}[max_{i in S} R_i]: the expected maximum reward of a size-K Plackett-Luce draw without replacement, the law of Gumbel-Top-K / Stochastic Beam Search decoding.
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.
arXiv:2609.21523v1 Announce Type: new Abstract: A system may be compressed before its downstream task is fully known. We ask how much retained state is then necessary and how much can be saved by lim...
arXiv:2507. 09473v2 Announce Type: replace-cross Abstract: We study the dynamic allocation of indivisible resources to strategic agents under long-term constraints, where the planner aims to maximize social welfare, satisfy multiple constraints, and elicit near-truthful reports.
arXiv:2503. 01701v2 Announce Type: replace-cross Abstract: Most microeconomic models of interest involve optimizing a piecewise linear function.
arXiv:2609.36486v1 Announce Type: new Abstract: We study an unknown-transition finite-horizon Markov decision process (MDP) with a finite collection of known reward functions $\{r^1, r^2, \ldots, r^M...
arXiv:2608. 12134v1 Announce Type: cross Abstract: We study nonnegative submodular maximization subject to a general matroid when the offline algorithm is given an arbitrary controlled value oracle.
arXiv:2605. 00762v2 Announce Type: replace Abstract: We study meritocratic fairness in budgeted combinatorial multi-armed bandits with full-bandit feedback, where a learner selects at most $K$ arms per time step and observes only the noisy aggregate reward of the selected set.
arXiv:2609.38132v1 Announce Type: new Abstract: We study average-reward weakly-coupled Markov decision processes (WCMDPs), where a WCMDP consists of $N$ smaller MDPs, called arms, that share multiple...