On the impact of singleton strategies in congestion games
From MaRDI portal
Publication:5111703
Recommendations
Cites work
- scientific article; zbMATH DE number 5764829 (Why is no real title available?)
- scientific article; zbMATH DE number 1306871 (Why is no real title available?)
- A class of games possessing pure-strategy Nash equilibria
- A new model for selfish routing
- Convergence and approximation in potential games
- Efficiency of equilibria in uniform matroid congestion games
- Equilibrium points in n -person games
- Exact price of anarchy for polynomial congestion games
- Intrinsic robustness of the price of anarchy
- On the existence of pure Nash equilibria in weighted congestion games
- On the impact of combinatorial structure on congestion games
- On the performance of approximate equilibria in congestion games
- Performance of one-round walks in linear congestion games
- Pure Nash equilibria in player-specific and weighted congestion games
- Selfish load balancing and atomic congestion games
- Selfish unsplittable flows
- Stackelberg strategies for atomic congestion games
- The complexity of pure Nash equilibria
- The curse of sequentiality in routing games
- The price of anarchy for polynomial social cost
- The price of anarchy of finite congestion games
- The price of routing unsplittable flow
- Tight bounds for selfish and greedy load balancing
- Weighted congestion games: price of anarchy, universal worst-case examples, and tightness
- Worst-case equilibria
Cited in
(16)- The price of anarchy of affine congestion games with similar strategies
- Using Temporal Dummy Players in Cost-Sharing Games
- Non-atomic one-round walks in congestion games
- The power of one evil secret agent
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- On the robustness of the approximate price of anarchy in generalized congestion games
- Congestion games with priority-based scheduling
- A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games
- Price of anarchy for parallel link networks with generalized mean objective
- Computing approximate equilibria in weighted congestion games via best-responses
- The power of one secret agent
- Monotonicity of equilibria in nonatomic congestion games
- The price of stability of weighted congestion games
- The price of stability of weighted congestion games
- On singleton congestion games with resilience against collusion
- Cost-sharing games in real-time scheduling systems
This page was built for publication: On the impact of singleton strategies in congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111703)