Selfish load balancing and atomic congestion games
From MaRDI portal
(Redirected from Publication:868439)
Recommendations
Cited in
(55)- Tight Bounds for Selfish and Greedy Load Balancing
- Stackelberg strategies for atomic congestion games
- Nash equilibria in two-resource congestion games with player-specific payoff functions
- scientific article; zbMATH DE number 7378728 (Why is no real title available?)
- Stackelberg Strategies for Atomic Congestion Games
- Selfish caching in distributed systems, a game-theoretic analysis
- The Influence of Link Restrictions on (Random) Selfish Routing
- Selfish load balancing for jobs with favorite machines
- Nash equilibria in discrete routing games with convex latency functions
- On the impact of singleton strategies in congestion games
- Balancing Load via Small Coalitions in Selfish Ring Routing Games
- Performance of non-cooperative routing over parallel non-observable queues
- The load-distance balancing problem
- The price of matching with metric preferences
- Graphical congestion games
- Efficient coordination mechanisms for unrelated machine scheduling
- The complexity of welfare maximization in congestion games
- Faster algorithms for semi-matching problems
- Leadership in singleton congestion games: what is hard and what is easy
- On the price of heterogeneity in parallel systems
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
- Tight bounds for online vector scheduling
- Transportation network with externalities
- Competitive online multicommodity routing
- Efficiency of equilibria in uniform matroid congestion games
- Improved bounds for distributed load balancing
- Tight bounds for selfish and greedy load balancing
- Nonadaptive Selfish Routing with Online Demands
- Equilibrium strategies for multiple interdictors on a common network
- Atomic routing games on maximum congestion
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
- Selfish load balancing
- Selfish Traffic Allocation for Server Farms
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- Inefficiency of games with social context
- Congestion games with priority-based scheduling
- Distributed selfish load balancing on networks
- Selfish Load Balancing Under Partial Knowledge
- Atomic routing game with capacity constraints
- Machine load balancing game with linear externalities
- 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
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
- Distributed selfish load balancing on networks
- 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
- Social context congestion games
- Smart routing of electric vehicles for load balancing in smart grids
- Atomic routing game with capacity constraints
- Machine load balancing game with linear externalities
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)
