Non-blind strategies in timed network congestion games
From MaRDI portal
Publication:2112118
DOI10.1007/978-3-031-15839-1_11OpenAlexW4293399535MaRDI QIDQ2112118
Ocan Sankur, Nicolas Markey, Aline Goeminne
Publication date: 18 January 2023
Full work available at URL: https://arxiv.org/abs/2207.01537
Cites Work
- Unnamed Item
- Unnamed Item
- Worst-case equilibria
- Nash equilibria and the price of anarchy for flows over time
- Competitive routing over time
- Potential games
- A Stackelberg strategy for routing flow over time
- Nash Equilibria in Concurrent Priced Games
- Contention Issues in Congestion Games
- Random Order Congestion Games
- The Price of Stability for Network Design with Fair Cost Allocation
- Alternating-time temporal logic
- The price of anarchy of finite congestion games
- Algorithmic Game Theory
- The network equilibrium problem in integers
- The Price of Routing Unsplittable Flow
This page was built for publication: Non-blind strategies in timed network congestion games
