In situations without central coordination, the price of anarchy relates the quality of any Nash equilibrium to the quality of a global optimum. Instead of assuming that all players choose their actions simultaneously, here we consider games where players choose their actions sequentially. The sequential price of anarchy, recently introduced by Paes Leme, Syrgkanis, and Tardos then relates the quality of any subgame perfect equilibrium to the quality of a global optimum. The effect of sequential decision making on the quality of equilibria, however, depends on the specific game under consideration. Here we analyze the sequential price of anarchy for atomic congestion games with affine cost functions. We derive several lower and upper bounds, showing that sequential decisions mitigate the worst case outcomes known for the classical price of anarchy. Next to tight bounds on the sequential price of anarchy, a methodological contribution of our work is, among other things, a "factor revealing" integer linear programming approach that we use to solve the case of three players.
|Place of Publication||Enschede|
|Publisher||Centre for Telematics and Information Technology (CTIT)|
|Number of pages||20|
|Publication status||Published - 18 Jul 2014|
|Name||CTIT Technical Report Series|
|Publisher||Centre for Telematics and Information Technology, University of Twente|
- Linear Programming
- Sequential Price of Anarchy
- Congestion Game
- Game Theory
- Game TheoryCongestion GameSequential Price of AnarchyEquilibriumLinear Programming
de Jong, J., & Uetz, M. J. (2014). The sequential price of anarchy for atomic congestion games. (CTIT Technical Report Series; No. TR-CTIT-14-09). Enschede: Centre for Telematics and Information Technology (CTIT).