On a generalized Cournot oligopolistic competition game
From MaRDI portal
Publication:2393078
DOI10.1007/s10898-012-9844-0zbMath1273.91245OpenAlexW2129960453MaRDI QIDQ2393078
Simai He, Xiaoguo Wang, Shu-Zhong Zhang
Publication date: 7 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9844-0
Noncooperative games (91A10) Other game-theoretic models (91A40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solving generalized Nash equilibrium problems via optimization
- Pareto optimality, game theory and equilibria
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Resource pricing games on graphs: existence of Nash equilibria
- A geometric approach to the price of anarchy in nonatomic congestion games
- A class of games possessing pure-strategy Nash equilibria
- A survey on networking games in telecommunications
- Generalized Quantity Competition for Multiple Products and Loss of Efficiency
- The Impact of Oligopolistic Competition in Networks
- The price of anarchy of finite congestion games
- Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
- Intrinsic robustness of the price of anarchy
- The price of selfish routing
- Mixed equilibrium (ME) for multiclass routing games
- Competitive routing in networks with polynomial costs
- The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
- New bounds for the price of anarchy under nonlinear and asymmetric costs
- Algorithmic Game Theory
- Exact Price of Anarchy for Polynomial Congestion Games
- The Price of Routing Unsplittable Flow
- The price of anarchy is independent of the network topology
This page was built for publication: On a generalized Cournot oligopolistic competition game