The following pages link to (Q3524729):
Displaying 28 items.
- Concurrent imitation dynamics in congestion games (Q287990) (← links)
- Cost-sharing scheduling games on restricted unrelated machines (Q306273) (← links)
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
- Smoothed performance guarantees for local search (Q403643) (← links)
- Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
- Strong stability of Nash equilibria in load balancing games (Q477108) (← links)
- Convergence of best-response dynamics in games with conflicting congestion effects (Q477597) (← links)
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness (Q503458) (← links)
- Competitive routing over time (Q719282) (← links)
- The strong price of anarchy of linear bottleneck congestion games (Q905688) (← links)
- Efficiency analysis with respect to the unit cost objectives in scheduling games (Q1645201) (← links)
- Colocating tasks in data centers using a side-effects performance model (Q1754339) (← links)
- Surrogate optimization for \(p\)-norms (Q2010926) (← links)
- A unifying approximate potential for weighted congestion games (Q2109950) (← links)
- The power of one evil secret agent (Q2196556) (← links)
- The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler (Q2197545) (← links)
- Two-group knapsack game (Q2268867) (← links)
- Measurement-based efficient resource allocation with demand-side adjustments (Q2280775) (← links)
- Improved price of anarchy for machine scheduling games with coordination mechanisms (Q2311122) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Strong equilibria in games with the lexicographical improvement property (Q2376067) (← links)
- Efficiency analysis of load balancing games with and without activation costs (Q2434275) (← links)
- Distributed Learning of Wardrop Equilibria (Q3543331) (← links)
- Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Project games (Q5925706) (← links)
- Load rebalancing games in dynamic systems with migration costs (Q5964072) (← links)
