On the convergence to Nash equilibrium in problems of distributed computing

DOI10.1023/A:1016312521369MaRDI QIDQ1614144zbMATH OpenFDO

Authors T. Boulogne, Eitan Altman, Odile Pourtallier

Publication date 3 September 2002

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

game theorynetworksNash equilibriumload balancingstability of equilibrium

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Noncooperative games (91A10)

Recommendations

• scientific article; zbMATH DE number 2202840
• Approaching equilibrium in parallel
• Distributed algorithms for the computation of noncooperative equilibria
• Convergence to approximate Nash equilibria in congestion games
• Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions

Cited in

(9)

• A survey on networking games in telecommunications
• Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
• Game-theoretic analysis of Internet switching with selfish users
• Cooperative networks games with elastic demands
• Convergence analysis of iterated best response for a trusted computation game
• scientific article; zbMATH DE number 2202840 (Why is no real title available?)
• Convergence analysis of distributed population dynamics based on second-order Delaunay triangulation
• Distributed Methods for Computing Approximate Equilibria
• Distributed algorithms for the computation of noncooperative equilibria

This page was built for publication: On the convergence to Nash equilibrium in problems of distributed computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1614144)