Convergence time to Nash equilibria

DOI10.1007/3-540-45061-0_41MaRDI QIDQ4449199zbMATH OpenFDO

Authors Eyal Even-Dar, Yishay Mansour, Alex Kesselman

Publication date 8 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190502.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Noncooperative games (91A10) Applications of game theory (91A80)

Recommendations

• scientific article; zbMATH DE number 3974777
• Convergence to approximate Nash equilibria in congestion games
• Convergence to approximate Nash equilibria in congestion games
• scientific article; zbMATH DE number 3898642
• scientific article; zbMATH DE number 1880284
• scientific article; zbMATH DE number 3965861
• scientific article; zbMATH DE number 1393072
• Convergence time to Nash equilibrium in selfish bin packing
• Convergence in games with continua of equilibria
• Fast convergence to Nash equilibria without steady-state oscillation

Cited in

(39)

• Strong price of anarchy
• Pure Nash equilibria in player-specific and weighted congestion games
• Coordination mechanisms for selfish scheduling
• Weighted congestion games with separable preferences
• Security from the adversary's inertia-controlling convergence speed when playing mixed strategy equilibria
• The power of one evil secret agent
• On spectrum sharing games
• Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
• Mixed Nash equilibria in selfish routing problems with dynamic constraints
• Selfish unsplittable flows
• Complexity and optimality of the best response algorithm in random potential games
• Bounds for the convergence time of local search in scheduling problems
• Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
• The power of one secret agent
• Optimal coordination mechanisms for unrelated machine scheduling
• Distributed Learning of Wardrop Equilibria
• Convergence and approximation in potential games
• Convergence of best-response dynamics in games with conflicting congestion effects
• scientific article; zbMATH DE number 1880284 (Why is no real title available?)
• scientific article; zbMATH DE number 1393072 (Why is no real title available?)
• Network topology and equilibrium existence in weighted network congestion games
• A metaheuristic approach to compute pure Nash equilibria
• The Price of Anarchy on Uniformly Related Machines Revisited
• Atomic Congestion Games: Fast, Myopic and Concurrent
• The Price of Stochastic Anarchy
• Cost-sharing games in real-time scheduling systems
• Load rebalancing games in dynamic systems with migration costs
• Convergence to approximate Nash equilibria in congestion games
• Entrepreneurship facility-activation games
• Sequential solutions in machine scheduling games
• The existence of a pure-strategy Nash equilibrium in a discrete ponds dilemma
• Node-max-cut and the complexity of equilibrium in linear weighted congestion games
• Coordination mechanisms on unrelated machines with arbitrary priority lists
• Game-theoretic analysis of Internet switching with selfish users
• Coordination mechanisms with rank-based utilities
• Congestion games with load-dependent failures: Identical resources
• The structure and complexity of Nash equilibria for a selfish routing game
• Balls into non-uniform bins
• Capacitated network design games

This page was built for publication: Convergence time to Nash equilibria

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