The following pages link to Network Games with Atomic Players (Q3613787):
Displaying 12 items.
- Approximating Wardrop equilibria with finitely many agents (Q352247) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- The price of atomic selfish ring routing (Q975753) (← links)
- Using inverse optimization to learn cost functions in generalized Nash games (Q2146979) (← links)
- Connections between mean-field game and social welfare optimization (Q2280979) (← links)
- The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
- The Impact of Oligopolistic Competition in Networks (Q3100438) (← links)
- Distributed Learning of Wardrop Equilibria (Q3543331) (← links)
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow (Q3602835) (← links)
- Management of Variable Data Streams in Networks (Q3637322) (← links)
- Balancing Load via Small Coalitions in Selfish Ring Routing Games (Q5245837) (← links)
- Nonadaptive Selfish Routing with Online Demands (Q5458504) (← links)