Pages that link to "Item:Q5449800"
From MaRDI portal
The following pages link to Exact Price of Anarchy for Polynomial Congestion Games (Q5449800):
Displayed 15 items.
- Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
- Good programming in transactional memory: game theory meets multicore architecture (Q553350) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- On best response dynamics in weighted congestion games with polynomial delays (Q661067) (← links)
- Coordination mechanisms (Q838145) (← links)
- The price of anarchy for polynomial social cost (Q861255) (← links)
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- Stackelberg strategies for atomic congestion games (Q987387) (← links)
- Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
- Restoring Pure Equilibria to Weighted Congestion Games (Q3012946) (← links)
- On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games (Q3162531) (← links)
- Malicious Bayesian Congestion Games (Q3602834) (← links)
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow (Q3602835) (← links)
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy (Q5459970) (← links)