The sequential price of anarchy for atomic congestion games
From MaRDI portal
Publication:2937005
DOI10.1007/978-3-319-13129-0_35zbMATH Open1404.91062OpenAlexW2123036301MaRDI QIDQ2937005FDOQ2937005
Authors: Jasper de Jong, Marc Uetz 
Publication date: 7 January 2015
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/the-sequential-price-of-anarchy-for-atomic-congestion-games(12ab2cd2-d0f3-4a72-aaba-8fba9338d91d).html
Recommendations
Cited In (18)
- Stackelberg Strategies for Atomic Congestion Games
- The inefficiency of Nash and subgame perfect equilibria for network routing
- A convergence analysis of the price of anarchy in atomic congestion games
- Exact price of anarchy for weighted congestion games with two players
- The curse of sequentiality in routing games
- The limit of targeting in networks
- Dynamic resource allocation games
- Tight bounds for the price of anarchy and stability in sequential transportation games
- Equilibrium analysis of customer attraction games
- Dynamic Atomic Congestion Games with Seasonal Flows
- On the sequential price of anarchy of isolation games
- On the sequential price of anarchy of isolation games
- The quality of equilibria for set packing and throughput scheduling games
- The sequential price of anarchy for affine congestion games with few players
- Coordination mechanisms for scheduling selfish jobs with favorite machines
- Sequential solutions in machine scheduling games
- Dynamic resource allocation games
- Some anomalies of farsighted strategic behavior
This page was built for publication: The sequential price of anarchy for atomic congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2937005)
