We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...