The sequential price of anarchy for atomic congestion games
From MaRDI portal
Publication:2937005
Recommendations
Cited in
(18)- Some anomalies of farsighted strategic behavior
- Sequential solutions in machine scheduling games
- Exact price of anarchy for weighted congestion games with two players
- Equilibrium analysis of customer attraction games
- Coordination mechanisms for scheduling selfish jobs with favorite machines
- The quality of equilibria for set packing and throughput scheduling games
- The inefficiency of Nash and subgame perfect equilibria for network routing
- The limit of targeting in networks
- On the sequential price of anarchy of isolation games
- A convergence analysis of the price of anarchy in atomic congestion games
- Tight bounds for the price of anarchy and stability in sequential transportation games
- On the sequential price of anarchy of isolation games
- Dynamic resource allocation games
- The sequential price of anarchy for affine congestion games with few players
- Dynamic resource allocation games
- The curse of sequentiality in routing games
- Stackelberg Strategies for Atomic Congestion Games
- Dynamic Atomic Congestion Games with Seasonal Flows
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)