The paper studies how to allocate indivisible goods to strategic agents with additive valuations without monetary transfers. It investigates whether mechanisms can guarantee pure Nash equilibria while ensuring fairness, focusing on envy‑freeness up to one good (EF1) and envy‑freeness up to any good (EFX). The authors show that the Round‑Robin algorithm yields EF1 allocations at every pure Nash equilibrium, and that a cut‑and‑choose algorithm for two agents produces EFX and maximin share fair allocations in equilibrium, a property absent in the non‑strategic setting.
By Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenh\"auser
arXiv:2609.07974v1 Announce Type: cross
Abstract: Fairness in clustering has attracted sustained research interest, motivated by the need to ensure equitable representation of protected groups in mac...
By Kangke Cheng, Guanlin Mo, Shihong Song, Hu Ding
arXiv:2610.15520v1 Announce Type: cross
Abstract: We investigate the problem of allocating indivisible chores among agents with arbitrary positive weights and additive nonnegative cost functions. An...
By Trung Thanh Nguyen, Khaled Elbassioni, J\"{o}rg Rothe
arXiv:2610. 37828v1 Announce Type: cross Abstract: An AI developer often has several candidate versions of a system and can deploy a mixture of them, sending each request to a randomly chosen version, as in A/B testing.
By Nicholas Teh, Paul W. Goldberg
arXiv:2510. 15076v2 Announce Type: replace Abstract: The $\ell_p$-norm objectives for correlation clustering present a fundamental trade-off between minimizing total disagreements (the $\ell_1$-norm) and ensuring fairness to individual nodes (the $\ell_\infty$-norm).
By Sami Davies, Benjamin Moseley, Heather Newman
arXiv:2608. 06469v1 Announce Type: cross Abstract: Collaborative machine learning among financial institutions must be both group-fair and robust against deliberate adversarial manipulation.
By Devharsh Trivedi, Nesrine Kaaniche, Nikos Triandopoulos, Maryline Laurent, Jackson Walters
arXiv:2608.16947v2 Announce Type: replace-cross
Abstract: Dynamic Mixture-of-Experts Serving allocates k replica GPUs among m experts as workloads change. At each round, the online algorithm sees the...
By Ian D'Ambrosio (Nth Research Collective)
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).
By Georgios Amanatidis, Aris Filos-Ratsikas, Alkmini Sgouritsa
The paper investigates hierarchical clustering under an individual fairness constraint that limits relative distortion within local k‑nearest neighborhoods. It formulates this as a feasibility problem over dominated ultrametrics, characterizes the minimal multiplicative slack needed, identifies a sharp local threshold, proves stability under bounded perturbations, establishes monotonicity in k, and demonstrates a Θ(log n) separation between local and global realizability. Experiments on synthetic and real‑world datasets corroborate the theoretical findings.
By Binita Maity, Shrutimoy Das
arXiv:2608. 05327v1 Announce Type: cross Abstract: Our results show that the existence of a short high-utility protocol already suffices for efficient communication.
By Mark Bedaywi, Scott Emmons, Nika Haghtalab, Stuart Russell
arXiv:2608.29308v1 Announce Type: cross
Abstract: In metric social choice, each voter ranks a set of $m$ candidates by her distance to them in an unknown metric space. The cost of a candidate is its...
By Nisarg Shah
arXiv:2608. 06762v1 Announce Type: new Abstract: Bisimulation metrics quantify behavioral similarity in Markov decision processes, but their Wasserstein fixed-point operator updates every state pair and incurs quadratic pairwise work.
By Ibne Farabi Shihab, Joyanta Jyoti Mondal