scientific article; zbMATH DE number 2038734

zbMath1039.68017MaRDI QIDQ4449199

Yishay Mansour, Eyal Even-Dar, Alexander Kesselman

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190502.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Noncooperative games (91A10) Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (31)

Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games ⋮ Congestion games with load-dependent failures: Identical resources ⋮ Security from the adversary's inertia-controlling convergence speed when playing mixed strategy equilibria ⋮ The structure and complexity of Nash equilibria for a selfish routing game ⋮ Optimal Coordination Mechanisms for Unrelated Machine Scheduling ⋮ Unnamed Item ⋮ On spectrum sharing games ⋮ Balls into non-uniform bins ⋮ Bounds for the Convergence Time of Local Search in Scheduling Problems ⋮ A Metaheuristic Approach to Compute Pure Nash Equilibria ⋮ The power of one evil secret agent ⋮ Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks ⋮ Capacitated network design games ⋮ Convergence to approximate Nash equilibria in congestion games ⋮ Convergence and approximation in potential games ⋮ Distributed Learning of Wardrop Equilibria ⋮ Convergence of best-response dynamics in games with conflicting congestion effects ⋮ Network topology and equilibrium existence in weighted network congestion games ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ Game-theoretic analysis of Internet switching with selfish users ⋮ Load rebalancing games in dynamic systems with migration costs ⋮ The Price of Anarchy on Uniformly Related Machines Revisited ⋮ Atomic Congestion Games: Fast, Myopic and Concurrent ⋮ The Price of Stochastic Anarchy ⋮ Strong price of anarchy ⋮ Pure Nash equilibria in player-specific and weighted congestion games ⋮ Coordination mechanisms for selfish scheduling ⋮ Cost-sharing games in real-time scheduling systems ⋮ Complexity and Optimality of the Best Response Algorithm in Random Potential Games ⋮ Weighted congestion games with separable preferences ⋮ Selfish unsplittable flows

This page was built for publication: