Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The Price of Anarchy with Polynomial Edge Latency
The Price of Anarchy with Polynomial Edge Latency
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Algorithmic Game Theory
The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
Mathematics of Operations Research
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Eliciting Coordination with Rebates
Transportation Science
A survey on networking games in telecommunications
Computers and Operations Research
The Impact of Oligopolistic Competition in Networks
Operations Research
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Coalition formation and price of anarchy in cournot oligopolies
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Price of anarchy for polynomial wardrop games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Exact price of anarchy for polynomial congestion games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
The price of anarchy of cournot oligopoly
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Atomic selfish routing in networks: a survey
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Routing (un-) splittable flow in games with player-specific linear latency functions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Hi-index | 0.00 |
We consider a model whereby players compete for a set of shared resources to produce and sell substitute products in the same market, which can be viewed as a generalization of the classical Cournot oligopolistic competition model, or, from a different angle, the Wardrop type routing model. In particular, we suppose that there are K players, who compete for the usage of resources as well as the sales of the end-products. Moreover, the unit costs of the shared resources and the selling prices of the products are assumed to be affine linear functions in the consumption/production quantities. We show that the price of anarchy in this case is lower bounded by 1/K, and this bound is essentially tight, which manifests the harsh nature of the competitive market for the producers.