Sensitivity of wardrop equilibria: revisited

DOI10.1007/s11590-020-01552-9zbMath1442.90197arXiv2002.05510OpenAlexW3008265732MaRDI QIDQ2174917

Changhyun Kwon, Mahdi Takalloo

Publication date: 27 April 2020

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.05510

zbMATH Keywords

sensitivity analysisprice of anarchyselfish routingwardrop equilibria

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31)

Related Items (1)

The price of anarchy in routing games as a function of the demand

Uses Software

• GitHub

Cites Work

• On the performance of approximate equilibria in congestion games
• Sensitivity of Wardrop equilibria
• Equilibrium points of nonatomic games
• A geometric approach to the price of anarchy in nonatomic congestion games
• A class of games possessing pure-strategy Nash equilibria
• How bad is selfish routing?
• Sensitivity analysis for the asymmetric network equilibrium problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sensitivity of wardrop equilibria: revisited