38 citations · 52 across the 8 of their papers we have counts for
9 papers
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…
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…
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…
The Impact of Selfish Behavior in Load Balancing Games
Vittorio Bilò, Cosimo Vinci
To what extent does the structure of the players' strategy space influence the efficiency of decentralized solutions in congestion games? In this work, we investigate whether bette…
Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology
Francisco Benita, Vittorio Bilò, Barnabé Monnot +2
We investigate traffic routing both from the perspective of theory as well as real world data. First, we introduce a new type of games: -free flow games. Here, commuters only co…
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…
Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies
Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
In the adaptive influence maximization problem, we are given a social network and a budget , and we iteratively select nodes, called seeds, in order to maximize the expected…
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback
Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
In the influence maximization (IM) problem, we are given a social network and a budget , and we look for a set of nodes in the network, called seeds, that maximize the expec…
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…