Existence of anonymous link tolls for decentralizing an oligopolistic game and the efficiency analysis
DOI10.3934/JIMO.2011.7.347zbMATH Open1219.91028OpenAlexW2329934763MaRDI QIDQ549892FDOQ549892
Publication date: 19 July 2011
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2011.7.347
Recommendations
- Efficiency of restricted tolls in non-atomic network routing games
- The toll effect on price of anarchy when costs are nonlinear and asymmetric
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Cost-balancing tolls for atomic network congestion games
- On the price of anarchy of highly congested nonatomic network games
- On the price of anarchy for high-price links
- Analysis of Price of Total Anarchy in Congestion Games via Smoothness Arguments
- The Price of Anarchy of a Network Creation Game with Exponential Payoff
- Approximation and Online Algorithms
price of anarchyuser equilibriumsystem optimumanonymous link tollsasymmetric cost functionsoligopolistic games
Quadratic programming (90C20) Programming involving graphs or networks (90C35) Cooperative games (91A12) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial games (91A46)
This page was built for publication: Existence of anonymous link tolls for decentralizing an oligopolistic game and the efficiency analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549892)
