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: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.
By Nicholas Teh
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...
By Maxime Lucet, Nawal Benabbou, Aur\'elie Beynier, Nicolas Maudet
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
arXiv:2607. 23310v1 Announce Type: cross Abstract: We study an online variant of discrete fair division under generalized assignment budget constraints.
By Saar Cohen, Nicholas Teh, Paul W. Goldberg, Michael J. Wooldridge
We prove that computing a complete contiguous $\varepsilon$-envy-free cake allocation is PPAD-complete for normalized rational piecewise-constant additive valuations. The hardness holds even when $\va...
arXiv:2608. 03171v1 Announce Type: cross Abstract: We study fair allocations of indivisible goods among agents with heterogeneous monotone valuations.
By Thanasis Lianeas, Alkmini Sgouritsa, Minas Marios Sotiriou
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).
By Zih-Sian Yang, Yi-Hao Chen, Yu-Te Kuan, Cheng-Jui Wu, Chuang-Chieh Lin, Po-An Chen
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.
By Seyed Majid Zahedi, Rupert Freeman
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: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.
By Sagi Ohayon, Boaz Taitler, Omer Ben-Porat
arXiv:2610.20587v1 Announce Type: cross
Abstract: An agentic market is a decentralized serving-time market where AI agents bid to claim each user prompt. An agent's bid is based on its expected value...
By Shubhendu Trivedi, Jacob Eisenstein, Alekh Agarwal, Ian Gemp, Michael Kaisers, Adam Fisch