38 citations · 46 across the 5 of their papers we have counts for
9 papers
Nash Social Welfare in Selfish and Online Load Balancing
Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli +1
In load balancing problems there is a set of clients, each wishing to select a resource from a set of permissible ones, in order to execute a certain task. Each resource has a late…
Coalition Resilient Outcomes in Max k-Cut Games
Raffaello Carosi, Simone Fioravanti, Luciano Gualà +1
We investigate strong Nash equilibria in the \emph{max -cut game}, where we are given an undirected edge-weighted graph together with a set of colors. Node…
Generalized budgeted submodular set function maximization
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco +1
In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins. The goal is to find a subse…
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…
Stable Outcomes in Modified Fractional Hedonic Games
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
In coalition formation games self-organized coalitions are created as a result of the strategic interactions of independent agents. For each couple of agents , weight $w_{i,…
On Colorful Bin Packing Games
Vittorio Bilò, Francesco Cellinese, Giovanna Melideo +1
We consider colorful bin packing games in which selfish players control a set of items which are to be packed into a minimum number of unit capacity bins. Each item has one of $m\g…