Agame-theoretical approach to network capacity planning under competition
AbstractThe paper discusses the dimensioning strategies of two network providers (operators) that supply channels to the same population of users in a competitive environment. Usersare assumed to compete for best service (lowest blocking probability of new request), while operators wishto maximize their profits. This setting gives rise to two interconnected, noncooperative games: a) a users game, in which the partition of primary traffic between operators is determined by the operators' channel capacities and by the users' blocking-avoidance strategy; and b) a network dimensioning game between operators in which the players alternate dimensioning decisions thatmaximize their profit rate under the current channel capacity of his/her opponent. At least for two plausible users' blocking avoidance strategies discussed in the paper, the users game will always reach some algorithmic equilibrium. In the operators' game, the player strategies are given by their numbers of deployed chanels, limited by their available infrastructure resources. If the infrastrucutre is under-dimensioned with respect to the traffic rate, the operators game willreach a Nash equilibrium when both players reach full use of their available infrastructures. Otherweise, a Nash equilibrium may also arise if both operators incur the same deployment costs. If costs are asymmetric, though, the alternating game may enter a loop. If the asymmetry is modest, both players may then try to achieve a competitive monopoly in which the opponent is forced to leave the game or operate with a loss (negative profit). However, if the asymmetry is high enough, only the player with the lower costs can force his opponent to leave the game while still holding a profitable operation. --
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by International Telecommunications Society (ITS) in its series 22nd European Regional ITS Conference, Budapest 2011: Innovative ICT Applications - Emerging Regulatory, Economic and Policy Issues with number 52169.
Date of creation: 2011
Date of revision:
Contact details of provider:
Web page: http://www.itseurope.org/
network dimensioning; game theory; duopoly; Nash equilibrium; circuit switching; blocking probability;
Find related papers by JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-12-13 (All new papers)
- NEP-COM-2011-12-13 (Industrial Competition)
- NEP-GTH-2011-12-13 (Game Theory)
- NEP-IND-2011-12-13 (Industrial Organization)
- NEP-NET-2011-12-13 (Network Economics)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (ZBW - German National Library of Economics).
If references are entirely missing, you can add them using this form.