On the existence of optimal taxes for network congestion games with heterogeneous users
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
The price of optimum in a matching game
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
The effectiveness of stackelberg strategies and tolls for network congestion games
ACM Transactions on Algorithms (TALG)
Altruism in Atomic Congestion Games
ACM Transactions on Economics and Computation
| Hi-index | 0.01 |
We investigate the effectiveness of Stackelberg strategies for atomic congestion games with unsplittable demands. In our setting, only a fraction of the players are selfish, while the rest are willing to follow a predetermined strategy. A Stackelberg strategy assigns the coordinated players to appropriately selected strategies trying to minimize the performance degradation due to the selfish players. We consider two orthogonal cases, namely congestion games with affine latency functions and arbitrary strategies, and congestion games on parallel links with arbitrary non-decreasing latency functions. We restrict our attention to pure Nash equilibria and derive strong upper and lower bounds on the pure Price of Anarchy (PoA) under different Stackelberg strategies. For affine congestion games, we consider the Stackelberg strategies LLF and Scale introduced by Roughgarden (SIAM J. Comput. 33(2):332–350, 2004), and propose a new Stackelberg strategy called Cover. We establish an upper and a lower bound on the PoA of LLF that are quite close to each other, a nearly linear upper bound on the PoA of Scale, and a lower bound on the PoA of any (even randomized) Stackelberg strategy that assigns the coordinated players to their optimal strategies. Cover is suited for the case where the fraction of coordinated players is small but their number is larger than the number of resources. If the number of players is sufficiently larger than the number of resources, combining Cover with either LLF or Scale gives very strong upper bounds on the PoA, quite close to the best known bounds for non-atomic games with affine latencies. For congestion games on parallel links, we prove that the PoA of LLF matches that for non-atomic games on parallel links. In particular, we show that the PoA of LLF is at most 1/α for arbitrary latency functions, and at most $\alpha+(1-\alpha)\rho(\mathcal{D})$for latency functions in class $\mathcal{D}$, where α denotes the fraction of coordinated players. To establish the latter bound, we need to show that the PoA of atomic congestion games on parallel links is at most $\rho(\mathcal{D})$, i.e. it is bounded by the PoA of non-atomic congestion games with arbitrary strategies.