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
The Price of Anarchy on Uniformly Related Machines Revisited, Atomic Congestion Games: Fast, Myopic and Concurrent, The Price of Stochastic Anarchy, 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, 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, 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, Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games, Distributed Learning of Wardrop Equilibria
