Selfish load balancing and atomic congestion games
From MaRDI portal
Publication:868439
DOI10.1007/S00453-006-1211-4zbMATH Open1107.68026OpenAlexW2086748851MaRDI QIDQ868439FDOQ868439
Authors: Subhash Suri, Csaba D. Tóth, Yunhong Zhou 
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
Recommendations
Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (55)
- Nash equilibria in two-resource congestion games with player-specific payoff functions
- Title not available (Why is that?)
- Selfish caching in distributed systems, a game-theoretic analysis
- Stackelberg Strategies for Atomic Congestion Games
- Stackelberg strategies for atomic congestion games
- The Influence of Link Restrictions on (Random) Selfish Routing
- Selfish load balancing for jobs with favorite machines
- On the impact of singleton strategies in congestion games
- Balancing Load via Small Coalitions in Selfish Ring Routing Games
- Nash equilibria in discrete routing games with convex latency functions
- Performance of non-cooperative routing over parallel non-observable queues
- The load-distance balancing problem
- The price of matching with metric preferences
- Efficient coordination mechanisms for unrelated machine scheduling
- The complexity of welfare maximization in congestion games
- Graphical congestion games
- Faster algorithms for semi-matching problems
- Leadership in singleton congestion games: what is hard and what is easy
- Tight bounds for online vector scheduling
- On the price of heterogeneity in parallel systems
- Improved bounds for distributed load balancing
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
- Transportation network with externalities
- Efficiency of equilibria in uniform matroid congestion games
- Competitive online multicommodity routing
- Nonadaptive Selfish Routing with Online Demands
- Tight bounds for selfish and greedy load balancing
- Equilibrium strategies for multiple interdictors on a common network
- Atomic routing games on maximum congestion
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Selfish load balancing
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- Congestion games with priority-based scheduling
- Selfish Traffic Allocation for Server Farms
- Distributed selfish load balancing on networks
- Inefficiency of games with social context
- Selfish Load Balancing Under Partial Knowledge
- Machine load balancing game with linear externalities
- Atomic routing game with capacity constraints
- On Stackelberg strategies in affine congestion games
- Bottleneck congestion games with logarithmic price of anarchy
- The price of anarchy for the load balancing game with a randomizing scheduler
- Distributed selfish load balancing on networks
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
- Partition Equilibrium Always Exists in Resource Selection Games
- Partition equilibrium always exists in resource selection games
- Nash social welfare in selfish and online load balancing
- On Stackelberg strategies in affine congestion games
- The price of anarchy of affine congestion games with similar strategies
- Atomic routing game with capacity constraints
- Smart routing of electric vehicles for load balancing in smart grids
- Social context congestion games
- Machine load balancing game with linear externalities
- Tight Bounds for Selfish and Greedy Load Balancing
This page was built for publication: Selfish load balancing and atomic congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868439)
