Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
DOI10.1007/S00453-010-9482-1zbMATH Open1236.91091OpenAlexW2169139983MaRDI QIDQ2428697FDOQ2428697
Authors: Petra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, Zengjian Hu 
Publication date: 26 April 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-010-9482-1
Recommendations
- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks
- On the convergence to Nash equilibrium in problems of distributed computing
- Distributed convergence to Nash equilibria in network and average aggregative games
- Convergence and asymptotic agreement in distributed decision problems
- Distributed convergence to Nash equilibria in two-network zero-sum games
- Distributed algorithms for the computation of noncooperative equilibria
- Efficiency of dual equilibria in selfish task allocation to selfish machines
- Distributed methods for computing approximate equilibria
- Distributed Methods for Computing Approximate Equilibria
Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) (n)-person games, (n>2) (91A06)
Cites Work
- A class of games possessing pure-strategy Nash equilibria
- Markov chain algorithms for planar lattice structures
- Fast convergence of selfish rerouting
- On the impact of combinatorial structure on congestion games
- The complexity of pure Nash equilibria
- Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
- Convergence to approximate Nash equilibria in congestion games
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- Distributed selfish load balancing
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Title not available (Why is that?)
Cited In (6)
- Limit theorems for recursive delegation equilibria
- Concurrent imitation dynamics in congestion games
- A simple approach for adapting continuous load balancing processes to discrete settings
- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks
- The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem
- Distributed selfish load balancing with weights and speeds
This page was built for publication: Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2428697)
