IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2013y2013i1n480962.html

A Game‐Theoretic Analysis of Bandwidth Allocation under a User‐Grouping Constraint

Author

Listed:
  • Shun-Pin Hsu
  • Shun-Liang Hsu
  • Alan Shenghan Tsai

Abstract

A new bandwidth allocation model is studied in this paper. In this model, a system, such as a communication network, is composed of a finite number of users, and they compete for limited bandwidth resources. Each user adopts the decision that maximizes his or her own benefit characterized by the utility function. The decision space of each user is subject to constraints. In addition, some users form a group, and their joint decision space is also subject to constraints. Under the assumption that each user’s utility function satisfies some continuity and concavity conditions, the existence, uniqueness, and fairness, in some appropriate sense, of the Nash equilibrium point in the allocation game are proved. An algorithm yielding a sequence converging to the equilibrium point is proposed. Finally, a numerical example with detailed analysis is provided to illustrate the effectiveness of our work.

Suggested Citation

  • Shun-Pin Hsu & Shun-Liang Hsu & Alan Shenghan Tsai, 2013. "A Game‐Theoretic Analysis of Bandwidth Allocation under a User‐Grouping Constraint," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    • Handle: RePEc:wly:jnljam:v:2013:y:2013:i:1:n:480962
    DOI: 10.1155/2013/480962
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2013/480962
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/480962?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Oran Richman & Nahum Shimkin, 2007. "Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 215-232, February.
    2. Ayalvadi Ganesh & Koenraad Laevens & Richard Steinberg, 2007. "Congestion Pricing and Noncooperative Games in Communication Networks," Operations Research, INFORMS, vol. 55(3), pages 430-438, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Eitan Altman & Manjesh Kumar Hanawal & Rajesh Sundaresan, 2016. "Generalising diagonal strict concavity property for uniqueness of Nash equilibrium," Indian Journal of Pure and Applied Mathematics, Springer, vol. 47(2), pages 213-228, June.
    2. Umang Bhaskar & Lisa Fleischer & Darrell Hoy & Chien-Chung Huang, 2015. "On the Uniqueness of Equilibrium in Atomic Splittable Routing Games," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 634-654, March.
    3. Ma, Xiaoyu & Huang, Feiteng & Li, Xue & Zhang, Jihong, 2024. "Optimal contract design in mobile service industry considering network congestion," International Journal of Production Economics, Elsevier, vol. 267(C).
    4. Wang, Judith Y.T. & Ehrgott, Matthias, 2013. "Modelling route choice behaviour in a tolled road network with a time surplus maximisation bi-objective user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 342-360.
    5. Cheng Wan, 2016. "Strategic decentralization in binary choice composite congestion games," Post-Print hal-02885837, HAL.
    6. Cheng Wan, 2012. "Coalitions in Nonatomic Network Congestion Games," Post-Print hal-02885914, HAL.
    7. Wan, Cheng, 2016. "Strategic decentralization in binary choice composite congestion games," European Journal of Operational Research, Elsevier, vol. 250(2), pages 531-542.
    8. Meunier, Frédéric & Pradeau, Thomas, 2014. "The uniqueness property for networks with several origin–destination pairs," European Journal of Operational Research, Elsevier, vol. 237(1), pages 245-256.
    9. Hota, Ashish R. & Garg, Siddharth & Sundaram, Shreyas, 2016. "Fragility of the commons under prospect-theoretic risk attitudes," Games and Economic Behavior, Elsevier, vol. 98(C), pages 135-164.
    10. Cheng Wan, 2012. "Coalitions in Nonatomic Network Congestion Games," Mathematics of Operations Research, INFORMS, vol. 37(4), pages 654-669, November.
    11. Chia-Wei Kuo & Kwei-Long Huang & Chao-Lung Yang, 2017. "Optimal contract design for cloud computing service with resource service guarantee," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 1030-1044, September.
    12. Igal Milchtaich, 2015. "Network topology and equilibrium existence in weighted network congestion games," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 515-541, August.
    13. Alok Gupta & Boris Jukic & Dale O. Stahl & Andrew B. Whinston, 2011. "An Analysis of Incentives for Network Infrastructure Investment Under Different Pricing Strategies," Information Systems Research, INFORMS, vol. 22(2), pages 215-232, June.
    14. Zhixin Liu, 2012. "Equilibrium analysis of capacity allocation with demand competition," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 254-265, April.
    15. Ashish R. Hota & Siddharth Garg & Shreyas Sundaram, 2014. "Fragility of the Commons under Prospect-Theoretic Risk Attitudes," Papers 1408.5951, arXiv.org, revised Jun 2016.
    16. Tobias Harks & Max Klimm, 2012. "On the Existence of Pure Nash Equilibria in Weighted Congestion Games," Mathematics of Operations Research, INFORMS, vol. 37(3), pages 419-436, August.
    17. Satoru Fujishige & Michel X. Goemans & Tobias Harks & Britta Peis & Rico Zenklusen, 2017. "Matroids Are Immune to Braess’ Paradox," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 745-761, August.
    18. Tobias Harks & Veerle Timmermans, 2018. "Uniqueness of equilibria in atomic splittable polymatroid congestion games," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 812-830, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jnljam:v:2013:y:2013:i:1:n:480962. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.