Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks

DOI10.1007/s00453-010-9482-1zbMath1236.91091OpenAlexW2169139983MaRDI QIDQ2428697

Iman Hajirasouliha, Tom Friedetzky, Petra Berenbrink, 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

zbMATH Keywords

convergenceNash equilibriumweighted tasks

Mathematics Subject Classification ID

Applications of game theory (91A80) (n)-person games, (n>2) (91A06) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (2)

Concurrent imitation dynamics in congestion games ⋮ A simple approach for adapting continuous load balancing processes to discrete settings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of games possessing pure-strategy Nash equilibria
• Markov Chain Algorithms for Planar Lattice Structures
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• On the impact of combinatorial structure on congestion games
• The complexity of pure Nash equilibria
• Distributed selfish load balancing
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game

This page was built for publication: Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks