Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
Selfish Routing in Capacitated Networks
Mathematics of Operations Research
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands
Operations Research Letters
Coalition formation and price of anarchy in cournot oligopolies
WINE'10 Proceedings of the 6th international conference on Internet and network economics
The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games
Operations Research
Generalized Quantity Competition for Multiple Products and Loss of Efficiency
Operations Research
On a generalized Cournot oligopolistic competition game
Journal of Global Optimization
Hi-index | 0.00 |
Cournot oligopoly is typically inefficient in maximizing social welfare which is total surplus of consumer and producer. This paper quantifies the inefficiency of Cournot oligopoly with the term “price of anarchy”, i.e. the worst-case ratio of the maximum possible social welfare to the social welfare at equilibrium. With a parameterization of the equilibrium market share distribution, the inefficiency bounds are dependent on equilibrium market shares as well as market demand and number of firms. Equilibrium market share parameters are practically observable and analytically manageable. As a result, the price of anarchy of Cournot oligopoly established in this paper is applicable to both practical estimation and theoretical analysis.