On equilibria for ADM minimization games
From MaRDI portal
Recommendations
Cites work
- A class of games possessing pure-strategy Nash equilibria
- Algorithms, games, and the internet
- Better bounds for minimizing SONET ADMs
- Combinatorial Optimization with Rational Objective Functions
- Cost sharing
- How bad is selfish routing?
- scientific article; zbMATH DE number 3139273 (Why is no real title available?)
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- Minimization of SONET ADMs in ring networks revisited
- Non-cooperative games
- On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing
- Selfishness, collusion and power of local search for the ADMs minimization problem
- Strong price of anarchy
- The chord version for SONET ADMs minimization
- The price of selfish routing
- The Price of Stability for Network Design with Fair Cost Allocation
- Traffic partition in WDM/SONET rings to minimize SONET ADMs
- Worst-case equilibria
Cited in
(2)
This page was built for publication: On equilibria for ADM minimization games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429352)