activity
20132023
most citedAlmost Envy-Free Allocations with Connected Bundles

38 citations · 57 across the 4 of their papers we have counts for

collaborators

5 papers

cs.GT2023★ 1 cited

PAC learning and stabilizing Hedonic Games: towards a unifying approach

Simone Fioravanti, Michele Flammini, Bojana Kodric +1

We study PAC learnability and PAC stabilizability of Hedonic Games (HGs), i.e., efficiently inferring preferences or core-stable partitions from samples. We first expand the known…

cs.LG2021★ 11 cited

Unavailable Transit Feed Specification: Making it Available with Recurrent Neural Networks

Ludovico Iovino, Phuong T. Nguyen, Amleto Di Salle +2

Studies on public transportation in Europe suggest that European inhabitants use buses in ca. 56% of all public transport travels. One of the critical factors affecting such a perc…

cs.GT2018★ 38 cited

Almost Envy-Free Allocations with Connected Bundles

Vittorio Bilò, Ioannis Caragiannis, Michele Flammini +5

We study the existence of allocations of indivisible goods that are envy-free up to one good (EF1), under the additional constraint that each bundle needs to be connected in an und…

cs.AI2017★ 7 cited

Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games

Michele Flammini, Gianpiero Monaco, Qiang Zhang

Additively separable hedonic games and fractional hedonic games have received considerable attention. They are coalition forming games of selfish agents based on their mutual prefe…

cs.GT2013

Approximating the Revenue Maximization Problem with Sharp Demands

Vittorio Bilò, Michele Flammini, Gianpiero Monaco

We consider the revenue maximization problem with sharp multi-demand, in which indivisible items have to be sold to potential buyers. Each buyer is interested in gettin…