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