Selfish load balancing and atomic congestion games
From MaRDI portal
Publication:868439
DOI10.1007/s00453-006-1211-4zbMath1107.68026MaRDI QIDQ868439
Yunhong Zhou, Subhash Suri, Csaba D. Tóth
Publication date: 5 March 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-006-1211-4
91A80: Applications of game theory
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Tight Bounds for Online Vector Scheduling, Unnamed Item, Unnamed Item, Unnamed Item, Nonadaptive Selfish Routing with Online Demands, The Influence of Link Restrictions on (Random) Selfish Routing, Congestion games with priority-based scheduling, Inefficiency of pure Nash equilibria in series-parallel network congestion games, Partition equilibrium always exists in resource selection games, Social context congestion games, Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness, Graphical congestion games, Tight bounds for selfish and greedy load balancing, A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games, On the price of heterogeneity in parallel systems, Atomic routing games on maximum congestion, Competitive online multicommodity routing, Inefficiency of games with social context, Nash equilibria in discrete routing games with convex latency functions, Stackelberg strategies for atomic congestion games, Congestion games with linearly independent paths: convergence time and price of anarchy, Equilibrium strategies for multiple interdictors on a common network, Atomic routing game with capacity constraints, Transportation network with externalities, Smart routing of electric vehicles for load balancing in smart grids, The price of anarchy of affine congestion games with similar strategies, Leadership in singleton congestion games: what is hard and what is easy, On Stackelberg strategies in affine congestion games, Efficient coordination mechanisms for unrelated machine scheduling, Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines, Faster Algorithms for Semi-Matching Problems, Efficiency of Equilibria in Uniform Matroid Congestion Games, The complexity of welfare maximization in congestion games, Partition Equilibrium Always Exists in Resource Selection Games, Bottleneck Congestion Games with Logarithmic Price of Anarchy, The Price of Matching with Metric Preferences, On Stackelberg Strategies in Affine Congestion Games
