Convergence time to Nash equilibrium in load balancing
From MaRDI portal
Publication:3580944
DOI10.1145/1273340.1273348zbMath1192.68956OpenAlexW2072951587MaRDI QIDQ3580944
Eyal Even-Dar, Yishay Mansour, Alexander 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
Related Items (41)
Concurrent imitation dynamics in congestion games ⋮ Security from the adversary's inertia-controlling convergence speed when playing mixed strategy equilibria ⋮ Optimal cost sharing for capacitated facility location games ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Strong equilibria in games with the lexicographical improvement property ⋮ On the convergence of multicast games in directed networks ⋮ Decentralized job scheduling in the cloud based on a spatially generalized \textit{Prisoner's Dilemma} game ⋮ Scheduling selfish jobs on multidimensional parallel machines ⋮ Load balancing via random local search in closed and open systems ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ Maximizing the minimum load: the cost of selfishness ⋮ \(\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 in a class of aggregative location games ⋮ The price of anarchy on uniformly related machines revisited ⋮ Congestion games with capacitated resources ⋮ Designing fast converging cost sharing methods for multicast transmissions ⋮ Characterizing the existence of potential functions in weighted congestion games ⋮ Non-clairvoyant scheduling games ⋮ A simple approach for adapting continuous load balancing processes to discrete settings ⋮ Prices of Anarchy of Selfish 2D Bin Packing Games ⋮ Distributed Learning of Wardrop Equilibria ⋮ Distributed algorithms for QoS load balancing ⋮ Stability vs. optimality in selfish ring routing ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ Distributed backup placement in networks ⋮ Amortized Analysis of Asynchronous Price Dynamics ⋮ A new model for selfish routing ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ Extending the notion of rationality of selfish agents: second order Nash equilibria ⋮ The cost of selfishness for maximizing the minimum load on uniformly related machines ⋮ Inefficiency of equilibria for the machine covering game on uniform machines ⋮ $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ Congestion Games with Variable Demands ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy ⋮ Selfish load balancing for jobs with favorite machines ⋮ Convergence Time to Nash Equilibrium in Selfish Bin Packing ⋮ Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
This page was built for publication: Convergence time to Nash equilibrium in load balancing
