Recommendations
Cites work
- scientific article; zbMATH DE number 2079324 (Why is no real title available?)
- scientific article; zbMATH DE number 2119691 (Why is no real title available?)
- Algorithms and Computation
- Convex Analysis
- Equilibria on a Congested Transportation Network
- How bad is selfish routing?
- On the relationship between Nash—Cournot and Wardrop equilibria
- Stackelberg scheduling strategies
- The price of anarchy is independent of the network topology
- The price of selfish routing
- Traffic assignment problem for a general network
- Worst-case equilibria
Cited in
(8)- Malicious Bayesian Congestion Games
- Computational aspects of uncertainty profiles and angel-daemon games
- Stackelberg thresholds in network routing games or the value of altruism
- Algorithms and Computation
- The Price of Malice: A Game-Theoretic Framework for Malicious Behavior in Distributed Systems
- Internalization of social cost in congestion games
- Congestion games with malicious players
- Uniform mixed equilibria in network congestion games with link failures
This page was built for publication: Equilibria for networks with malicious users
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985313)