Advanced Search
MyIDEAS: Login to save this paper or follow this series

Agame-theoretical approach to network capacity planning under competition

Contents:

Author Info

  • Waldman, Helio
  • Bortoletto, Rodrigo C.
  • Pavani, Gustavo S.
Registered author(s):

    Abstract

    The 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 Info

    If 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.
    File URL: http://econstor.eu/bitstream/10419/52169/1/672614758.pdf
    Download Restriction: no

    Bibliographic Info

    Paper 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.

    as in new window
    Length:
    Date of creation: 2011
    Date of revision:
    Handle: RePEc:zbw:itse11:52169

    Contact details of provider:
    Web page: http://www.itseurope.org/

    Related research

    Keywords: network dimensioning; game theory; duopoly; Nash equilibrium; circuit switching; blocking probability;

    Find related papers by JEL classification:

    This paper has been announced in the following NEP Reports:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:zbw:itse11:52169. See general 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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.