The following pages link to (Q4449199):
Displaying 31 items.
- Convergence and approximation in potential games (Q441854) (← links)
- Convergence of best-response dynamics in games with conflicting congestion effects (Q477597) (← links)
- Network topology and equilibrium existence in weighted network congestion games (Q495752) (← links)
- Convergence to approximate Nash equilibria in congestion games (Q632952) (← links)
- Game-theoretic analysis of Internet switching with selfish users (Q714792) (← links)
- Congestion games with load-dependent failures: Identical resources (Q834859) (← links)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- Balls into non-uniform bins (Q897392) (← links)
- Capacitated network design games (Q904684) (← links)
- Strong price of anarchy (Q1007765) (← links)
- Pure Nash equilibria in player-specific and weighted congestion games (Q1014625) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- Weighted congestion games with separable preferences (Q1036603) (← links)
- Security from the adversary's inertia-controlling convergence speed when playing mixed strategy equilibria (Q1630490) (← links)
- The power of one evil secret agent (Q2196556) (← links)
- On spectrum sharing games (Q2377140) (← links)
- Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks (Q2428697) (← links)
- Mixed Nash equilibria in selfish routing problems with dynamic constraints (Q2481950) (← links)
- Selfish unsplittable flows (Q2581267) (← links)
- Complexity and Optimality of the Best Response Algorithm in Random Potential Games (Q2819446) (← links)
- Bounds for the Convergence Time of Local Search in Scheduling Problems (Q2959840) (← links)
- Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games (Q3162508) (← links)
- (Q3301024) (← links)
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling (Q3450455) (← links)
- Distributed Learning of Wardrop Equilibria (Q3543331) (← links)
- A Metaheuristic Approach to Compute Pure Nash Equilibria (Q5111130) (← links)
- The Price of Anarchy on Uniformly Related Machines Revisited (Q5459971) (← links)
- Atomic Congestion Games: Fast, Myopic and Concurrent (Q5459977) (← links)
- The Price of Stochastic Anarchy (Q5459995) (← links)
- Cost-sharing games in real-time scheduling systems (Q5925633) (← links)
- Load rebalancing games in dynamic systems with migration costs (Q5964072) (← links)
