scientific article
From MaRDI portal
Publication:3524729
zbMath1151.91322MaRDI QIDQ3524729
Publication date: 12 September 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (28)
Concurrent imitation dynamics in congestion games ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Strong equilibria in games with the lexicographical improvement property ⋮ Cost-sharing scheduling games on restricted unrelated machines ⋮ Efficiency analysis with respect to the unit cost objectives in scheduling games ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ Reducing price of anarchy of selfish task allocation with more selfishness ⋮ Smoothed performance guarantees for local search ⋮ On Submodular Search and Machine Scheduling ⋮ The power of one evil secret agent ⋮ The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler ⋮ The strong price of anarchy of linear bottleneck congestion games ⋮ Efficiency analysis of load balancing games with and without activation costs ⋮ Performance guarantees of jump neighborhoods on restricted related parallel machines ⋮ Distributed Learning of Wardrop Equilibria ⋮ Strong stability of Nash equilibria in load balancing games ⋮ Convergence of best-response dynamics in games with conflicting congestion effects ⋮ Symmetry exploitation for online machine covering with bounded migration ⋮ Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness ⋮ Colocating tasks in data centers using a side-effects performance model ⋮ Surrogate optimization for \(p\)-norms ⋮ Two-group knapsack game ⋮ Competitive routing over time ⋮ Measurement-based efficient resource allocation with demand-side adjustments ⋮ Load rebalancing games in dynamic systems with migration costs ⋮ Project games ⋮ Improved price of anarchy for machine scheduling games with coordination mechanisms ⋮ A unifying approximate potential for weighted congestion games
This page was built for publication: