Mixed Nash equilibria in selfish routing problems with dynamic constraints

DOI10.1016/j.tcs.2007.11.017zbMath1136.91003OpenAlexW2037286076MaRDI QIDQ2481950

Alessandro Ferrante

Publication date: 15 April 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.11.017

zbMATH Keywords

Nash equilibriumnon-cooperative gamesselfish routing

Mathematics Subject Classification ID

Noncooperative games (91A10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate equilibria and ball fusion
• Non-cooperative games
• How bad is selfish routing?
• On the existence of equilibria in noncooperative optimal flow control
• The price of selfish routing
• Algorithms, games, and the internet
• STACS 2004
• Mathematical Foundations of Computer Science 2004
• Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
• Automata, Languages and Programming
• Automata, Languages and Programming
• Topological Conditions for Uniqueness of Equilibrium in Networks
• Approximation and Online Algorithms
• Computing Nash equilibria for scheduling on restricted parallel links
• LATIN 2004: Theoretical Informatics

This page was built for publication: Mixed Nash equilibria in selfish routing problems with dynamic constraints