Distributionally robust tolls for single-OD affine-latency congestion games are solvable by convex programming and reduce system latency more than nominal tolls under model uncertainty.
Competitive Pricing for Spec- trum Sharing in Cognitive Radio Networks: Dynamic Game, Inef- ficiency of Nash Equilibrium, and Collusion
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributionally Robust Tolls for Traffic Networks with Affine Latency Functions
Distributionally robust tolls for single-OD affine-latency congestion games are solvable by convex programming and reduce system latency more than nominal tolls under model uncertainty.