Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 57, No. 5, September-October 2009, pp. 1220-1235
DOI: 10.1287/opre.1080.0686
This Article
Right arrow Full Text (PDF)
Right arrow e-companion
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Google Scholar
Right arrow Articles by DeMiguel, V.
Right arrow Articles by Xu, H.

A Stochastic Multiple-Leader Stackelberg Model: Analysis, Computation, and Application

Victor DeMiguel, Huifu Xu

Department of Management Science and Operations, London Business School, Regent's Park, London NW1 4SA, United Kingdom
School of Mathematics, University of Southampton, Highfield, Southampton SO17 1BJ, United Kingdom

avmiguel{at}london.edu
h.xu{at}maths.soton.ac.uk

We study an oligopoly consisting of M leaders and N followers that supply a homogeneous product (or service) noncooperatively. Leaders choose their supply levels first, knowing the demand function only in distribution. Followers make their decisions after observing the leader supply levels and the realized demand function. We term the resulting equilibrium a stochastic multiple-leader Stackelberg-Nash-Cournot (SMS) equilibrium. We show the existence and uniqueness of SMS equilibrium under mild assumptions. We also propose a computational approach to find the equilibrium based on the sample average approximation method and analyze its rate of convergence. Finally, we apply this framework to model competition in the telecommunication industry.

Subject classifications: programming; noncooperative games/group decisions; Stackelberg game; equilibrium existence; uniqueness; sample average approximation.
History: Received October 2006; revision received February 2008; accepted September 2008.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2009 by INFORMS.