Inter-network dynamic spectrum allocation via a Colonel Blotto game

Mohammad Hajimirsadeghi, Gokul Sridharan, Walid Saad, Narayan Mandayam

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

This paper investigates a scenario where multiple network service providers (NSPs) compete to provide wireless connectivity to a set of users. The users could either be a single mobile device, a set of localized Internet-of-Things (IoT) devices, or even a campus-wide network requiring wireless backhaul. The NSPs compete with one another to provide wireless service to the users by strategically allocating the available bandwidth so as to maximize their total payoff. The NSPs present each user with an offer to provide wireless connectivity using a certain amount of bandwidth. Users then decide to connect to that NSP whose offered bandwidth maximizes their utility function. Under such an architecture, this paper focuses on the optimal bandwidth allocation strategies for the NSPs. Such a problem is best modeled using a classical problem in game theory called the Colonel Blotto game-a multidimensional strategic resource allocation game. We show that the problem of spectrum allocation can be reframed as a Colonel Blotto game and analyze the mixed strategies that achieve Nash equilibrium. Depending on whether spectrum is treated a discrete or a continuous resource, we take recourse to either existing theoretical results or rely on numerical techniques to establish the equilibrium-achieving mixed strategies. We finally discuss interesting aspects about these mixed strategies, including an intrinsic user-association mechanism that emerges when spectral efficiency is taken into consideration.

Original languageEnglish (US)
Title of host publication2016 50th Annual Conference on Information Systems and Sciences, CISS 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages252-257
Number of pages6
ISBN (Electronic)9781467394574
DOIs
StatePublished - Apr 26 2016
Event50th Annual Conference on Information Systems and Sciences, CISS 2016 - Princeton, United States
Duration: Mar 16 2016Mar 18 2016

Publication series

Name2016 50th Annual Conference on Information Systems and Sciences, CISS 2016

Other

Other50th Annual Conference on Information Systems and Sciences, CISS 2016
CountryUnited States
CityPrinceton
Period3/16/163/18/16

Fingerprint

Bandwidth
Frequency allocation
Game theory
Mobile devices
Resource allocation
Wireless networks
Internet of things

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

Keywords

  • Colonel Blotto game
  • Mixed strategies
  • Noncooperative game theory
  • Spectrum allocation

Cite this

Hajimirsadeghi, M., Sridharan, G., Saad, W., & Mandayam, N. (2016). Inter-network dynamic spectrum allocation via a Colonel Blotto game. In 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016 (pp. 252-257). [7460510] (2016 50th Annual Conference on Information Systems and Sciences, CISS 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CISS.2016.7460510
Hajimirsadeghi, Mohammad ; Sridharan, Gokul ; Saad, Walid ; Mandayam, Narayan. / Inter-network dynamic spectrum allocation via a Colonel Blotto game. 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 252-257 (2016 50th Annual Conference on Information Systems and Sciences, CISS 2016).
@inproceedings{4ce3b79bee4a4c6f86079f25c1035c05,
title = "Inter-network dynamic spectrum allocation via a Colonel Blotto game",
abstract = "This paper investigates a scenario where multiple network service providers (NSPs) compete to provide wireless connectivity to a set of users. The users could either be a single mobile device, a set of localized Internet-of-Things (IoT) devices, or even a campus-wide network requiring wireless backhaul. The NSPs compete with one another to provide wireless service to the users by strategically allocating the available bandwidth so as to maximize their total payoff. The NSPs present each user with an offer to provide wireless connectivity using a certain amount of bandwidth. Users then decide to connect to that NSP whose offered bandwidth maximizes their utility function. Under such an architecture, this paper focuses on the optimal bandwidth allocation strategies for the NSPs. Such a problem is best modeled using a classical problem in game theory called the Colonel Blotto game-a multidimensional strategic resource allocation game. We show that the problem of spectrum allocation can be reframed as a Colonel Blotto game and analyze the mixed strategies that achieve Nash equilibrium. Depending on whether spectrum is treated a discrete or a continuous resource, we take recourse to either existing theoretical results or rely on numerical techniques to establish the equilibrium-achieving mixed strategies. We finally discuss interesting aspects about these mixed strategies, including an intrinsic user-association mechanism that emerges when spectral efficiency is taken into consideration.",
keywords = "Colonel Blotto game, Mixed strategies, Noncooperative game theory, Spectrum allocation",
author = "Mohammad Hajimirsadeghi and Gokul Sridharan and Walid Saad and Narayan Mandayam",
year = "2016",
month = "4",
day = "26",
doi = "10.1109/CISS.2016.7460510",
language = "English (US)",
series = "2016 50th Annual Conference on Information Systems and Sciences, CISS 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "252--257",
booktitle = "2016 50th Annual Conference on Information Systems and Sciences, CISS 2016",
address = "United States",

}

Hajimirsadeghi, M, Sridharan, G, Saad, W & Mandayam, N 2016, Inter-network dynamic spectrum allocation via a Colonel Blotto game. in 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016., 7460510, 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016, Institute of Electrical and Electronics Engineers Inc., pp. 252-257, 50th Annual Conference on Information Systems and Sciences, CISS 2016, Princeton, United States, 3/16/16. https://doi.org/10.1109/CISS.2016.7460510

Inter-network dynamic spectrum allocation via a Colonel Blotto game. / Hajimirsadeghi, Mohammad; Sridharan, Gokul; Saad, Walid; Mandayam, Narayan.

2016 50th Annual Conference on Information Systems and Sciences, CISS 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 252-257 7460510 (2016 50th Annual Conference on Information Systems and Sciences, CISS 2016).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Inter-network dynamic spectrum allocation via a Colonel Blotto game

AU - Hajimirsadeghi, Mohammad

AU - Sridharan, Gokul

AU - Saad, Walid

AU - Mandayam, Narayan

PY - 2016/4/26

Y1 - 2016/4/26

N2 - This paper investigates a scenario where multiple network service providers (NSPs) compete to provide wireless connectivity to a set of users. The users could either be a single mobile device, a set of localized Internet-of-Things (IoT) devices, or even a campus-wide network requiring wireless backhaul. The NSPs compete with one another to provide wireless service to the users by strategically allocating the available bandwidth so as to maximize their total payoff. The NSPs present each user with an offer to provide wireless connectivity using a certain amount of bandwidth. Users then decide to connect to that NSP whose offered bandwidth maximizes their utility function. Under such an architecture, this paper focuses on the optimal bandwidth allocation strategies for the NSPs. Such a problem is best modeled using a classical problem in game theory called the Colonel Blotto game-a multidimensional strategic resource allocation game. We show that the problem of spectrum allocation can be reframed as a Colonel Blotto game and analyze the mixed strategies that achieve Nash equilibrium. Depending on whether spectrum is treated a discrete or a continuous resource, we take recourse to either existing theoretical results or rely on numerical techniques to establish the equilibrium-achieving mixed strategies. We finally discuss interesting aspects about these mixed strategies, including an intrinsic user-association mechanism that emerges when spectral efficiency is taken into consideration.

AB - This paper investigates a scenario where multiple network service providers (NSPs) compete to provide wireless connectivity to a set of users. The users could either be a single mobile device, a set of localized Internet-of-Things (IoT) devices, or even a campus-wide network requiring wireless backhaul. The NSPs compete with one another to provide wireless service to the users by strategically allocating the available bandwidth so as to maximize their total payoff. The NSPs present each user with an offer to provide wireless connectivity using a certain amount of bandwidth. Users then decide to connect to that NSP whose offered bandwidth maximizes their utility function. Under such an architecture, this paper focuses on the optimal bandwidth allocation strategies for the NSPs. Such a problem is best modeled using a classical problem in game theory called the Colonel Blotto game-a multidimensional strategic resource allocation game. We show that the problem of spectrum allocation can be reframed as a Colonel Blotto game and analyze the mixed strategies that achieve Nash equilibrium. Depending on whether spectrum is treated a discrete or a continuous resource, we take recourse to either existing theoretical results or rely on numerical techniques to establish the equilibrium-achieving mixed strategies. We finally discuss interesting aspects about these mixed strategies, including an intrinsic user-association mechanism that emerges when spectral efficiency is taken into consideration.

KW - Colonel Blotto game

KW - Mixed strategies

KW - Noncooperative game theory

KW - Spectrum allocation

UR - http://www.scopus.com/inward/record.url?scp=84992398773&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84992398773&partnerID=8YFLogxK

U2 - 10.1109/CISS.2016.7460510

DO - 10.1109/CISS.2016.7460510

M3 - Conference contribution

AN - SCOPUS:84992398773

T3 - 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016

SP - 252

EP - 257

BT - 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Hajimirsadeghi M, Sridharan G, Saad W, Mandayam N. Inter-network dynamic spectrum allocation via a Colonel Blotto game. In 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 252-257. 7460510. (2016 50th Annual Conference on Information Systems and Sciences, CISS 2016). https://doi.org/10.1109/CISS.2016.7460510