Stackelberg Strategies and Collusion in Network Games with Splittable Flow

We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmetric load balancing games and show that the price of anarchy is at most m , where m denotes the number of coalitions. For g...

Ausführliche Beschreibung