3 papers
cs.GT2025
Approximately Envy-free and Equitable Allocations of Indivisible Items for Non-monotone Valuations
Vittorio Bilò, Martin Loebl, Cosimo Vinci
We revisit the setting of fair allocation of indivisible items among agents with heterogeneous, non-monotone valuations. We explore the existence and efficient computation of alloc…
cs.DS2024
Stochastic Multi-round Submodular Optimization with Budget
Vincenzo Auletta, Diodato Ferraioli, Cosimo Vinci
In this work, we study the Stochastic Budgeted Multi-round Submodular Maximization (SBMSm) problem, where we aim to adaptively maximize the sum, over multiple rounds, of a monotone…
cs.GT2024
Minimizing Rosenthal's Potential in Monotone Congestion Games
Vittorio Bilò, Angelo Fanelli, Laurent Gourvès +2
Congestion games are attractive because they can model many concrete situations where some competing entities interact through the use of some shared resources, and also because th…