18 citations · 76 across the 24 of their papers we have counts for
4 papers · 1 filter
No truthful mechanism can be better than approximate for two natural problems
Stefano Leucci, Akaki Mamageishvili, Paolo Penna
This work gives the first natural non-utilitarian problems for which the trivial approximation via VCG mechanisms is the best possible. That is, no truthful mechanism can be be…
Locality-based Network Creation Games
Davide Bilò, Luciano Gualà, Stefano Leucci +1
Network creation games have been extensively studied, both from economists and computer scientists, due to their versatility in modeling individual-based community formation proces…
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game
Davide Bilò, Luciano Gualà, Stefano Leucci +1
Let be given a graph whose edge set is partitioned into a set of \emph{red} edges and a set of \emph{blue} edges, and assume that red edges are weighted and form…
The Max-Distance Network Creation Game on General Host Graphs
Davide Bilò, Luciano Gualà, Stefano Leucci +1
In this paper we study a generalization of the classic \emph{network creation game} in the scenario in which the players sit on a given arbitrary \emph{host graph}, which const…