Tight inefficiency bounds for perception-parameterized affine congestion games
We introduce a new model of congestion games that cap-tures several extensions of the classical congestion game introduced by Rosenthal in 1973. The idea here is to parameterize both the perceived cost of each player and the social cost function of the system designer. Intuitively, each player perceives the load induced by the other players by an extent of ρ ≥ 0, while the system designer estimates that each player perceives the load of all others by an extent of σ ≥ 0. For specific choices of ρ and σ, we obtain extensions such as altruistic player behav-ior, risk sensitive players and the imposition of taxes on the resources. We derive tight bounds on the price of anarchy and the price of stability for a large range of parameters. Our bounds provide a complete picture of the ineﬃciency of equilibria for these games. As a result, we obtain tight bounds on the price of anarchy and the price of stability for the above mentioned extensions. Our results also reveal how one should “design” the cost functions of the players in order to reduce the price of anarchy. Somewhat counterintuitively, if each player cares about all other players to the extent of ρ = 0.625 (instead of 1 in the standard setting) the price of anarchy reduces from 2.5 to 2.155 and this is best possible.
|Conference||International Conference on Algorithms and Complexity|
|Grant||This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/024.002.003 - Networks|
Kleer, P.S, & Schäfer, G. (2017). Tight inefficiency bounds for perception-parameterized affine congestion games. In Algorithms and Complexity (pp. 381–392). doi:10.1007/978-3-319-57586-5_32