Mixed Nash equilibria in selfish routing problems with dynamic constraints

DOI10.1016/J.TCS.2007.11.017zbMATH Open1136.91003OpenAlexW2037286076MaRDI QIDQ2481950FDOQ2481950

Authors: Alessandro Ferrante, Mimmo Parente 

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

Recommendations

• Structural Information and Communication Complexity
• The price of selfish routing
• Selfish Routing in Capacitated Networks
• The Influence of Link Restrictions on (Random) Selfish Routing
• Tradeoffs and average-case equilibria in selfish routing

zbMATH Keywords

Nash equilibriumselfish routingnon-cooperative games

Mathematics Subject Classification ID

Noncooperative games (91A10)

Cites Work

• Non-cooperative games
• Worst-case equilibria
• How bad is selfish routing?
• A course in game theory.
• Approximate equilibria and ball fusion
• Title not available (Why is that?)
• Algorithms, games, and the internet
• LATIN 2004: Theoretical Informatics
• Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
• Topological Conditions for Uniqueness of Equilibrium in Networks
• Title not available (Why is that?)
• The price of selfish routing
• Mathematical Foundations of Computer Science 2004
• Approximation and Online Algorithms
• Computing Nash equilibria for scheduling on restricted parallel links
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata, Languages and Programming
• On the existence of equilibria in noncooperative optimal flow control
• STACS 2004
• Automata, Languages and Programming

Cited In (5)

• Which is the worst-case Nash equilibrium?
• Uniform Mixed Equilibria in Network Congestion Games with Link Failures
• Title not available (Why is that?)
• Structural Information and Communication Complexity
• Mixed equilibria with common constraints on transportation networks

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

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