Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
We introduce and analyze q-potential games and qcongestion games, where q is a positive integer. A 1-potential (congestion) game is a potential (congestion) game. We show that a g...
With a shift in the on-line gaming landscape from individually hosted game servers, to gaming services centrally hosted by game publishers, game console manufacturers, and third-p...
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...