On poisoned Wardrop equilibrium in congestion games

DOI10.1007/978-3-031-26369-9_10zbMath1529.68067arXiv2209.00094OpenAlexW4319594808MaRDI QIDQ6116852

Quanyan Zhu, Yunian Pan

Publication date: 16 August 2023

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

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

zbMATH Keywords

sensitivity analysiscongestion gamesStackelberg gameadversarial attack

Mathematics Subject Classification ID

Hierarchical games (including Stackelberg games) (91A65) Learning and adaptive systems in artificial intelligence (68T05) Applications of game theory (91A80) Computer security (68M25)

Cites Work

• Unnamed Item
• A class of games possessing pure-strategy Nash equilibria
• On the Inefficiency of Equilibria in Congestion Games
• A Mathematical Model and Descent Algorithm for Bilevel Traffic Management
• The price of anarchy is independent of the network topology

This page was built for publication: On poisoned Wardrop equilibrium in congestion games