Convergence time to Nash equilibrium in load balancing
From MaRDI portal
Publication:3580944
DOI10.1145/1273340.1273348zbMATH Open1192.68956OpenAlexW2072951587MaRDI QIDQ3580944FDOQ3580944
Authors: Eyal Even-Dar, Yishay Mansour, Alex Kesselman 
Publication date: 14 August 2010
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1273340.1273348
Cited In (41)
- The price of anarchy on uniformly related machines revisited
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
- Reducing price of anarchy of selfish task allocation with more selfishness
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Load balancing via random local search in closed and open systems
- Extending the notion of rationality of selfish agents: second order Nash equilibria
- Inefficiency of equilibria for the machine covering game on uniform machines
- Decentralized utilitarian mechanisms for scheduling games
- Selfish load balancing for jobs with favorite machines
- Distributed backup placement in networks
- Nash equilibria in discrete routing games with convex latency functions
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- On the existence of pure Nash equilibria in weighted congestion games
- Security from the adversary's inertia-controlling convergence speed when playing mixed strategy equilibria
- Concurrent imitation dynamics in congestion games
- Efficient coordination mechanisms for unrelated machine scheduling
- Optimal cost sharing for capacitated facility location games
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- Distributed algorithms for QoS load balancing
- A simple approach for adapting continuous load balancing processes to discrete settings
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
- Amortized Analysis of Asynchronous Price Dynamics
- Congestion games with capacitated resources
- Decentralized job scheduling in the cloud based on a spatially generalized \textit{Prisoner's Dilemma} game
- Congestion games with linearly independent paths: convergence time and price of anarchy
- On the convergence of multicast games in directed networks
- Convergence time to Nash equilibrium in selfish bin packing
- Prices of Anarchy of Selfish 2D Bin Packing Games
- Designing fast converging cost sharing methods for multicast transmissions
- $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
- Scheduling selfish jobs on multidimensional parallel machines
- Characterizing the existence of potential functions in weighted congestion games
- Distributed Learning of Wardrop Equilibria
- A new model for selfish routing
- Stability vs. optimality in selfish ring routing
- Strong equilibria in games with the lexicographical improvement property
- Non-clairvoyant scheduling games
- Equilibria in a class of aggregative location games
- Maximizing the minimum load: the cost of selfishness
- Congestion games with variable demands
This page was built for publication: Convergence time to Nash equilibrium in load balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580944)
