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