A Caltech Library Service

Oligopoly pricing in congested networks

Melo, Emerson (2010) Oligopoly pricing in congested networks. In: BQGT '10 Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions. ACM , New York, NY, Art. No. 3. ISBN 978-1-60558-919-0.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


In this paper we study the problem of oligopoly pricing in congested markets when the demand faced by every firm is stochastic. In particular, we consider a general network, where every link is owned by a firm which charges prices in order to maximize its profits. In this environment we show the existence of a pure strategy price equilibrium, where the latency functions are assumed to satisfy continuity, monotonicity and convexity. Given this existence result, we show how to compute bounds for the inefficiency and how the result can be adapted to study price and capacity competition.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 2010 ACM.
Record Number:CaltechAUTHORS:20161130-160203344
Persistent URL:
Official Citation:Emerson Melo. 2010. Oligopoly pricing in congested networks. In Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions (BQGT '10). ACM, New York, NY, USA, , Article 3 , 1 pages. DOI=
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:72480
Deposited By: Kristin Buxton
Deposited On:01 Dec 2016 00:34
Last Modified:01 Dec 2016 00:34

Repository Staff Only: item control page