A Game-Theoretic Analysis of Bandwidth Allocation under a User-Grouping Constraint
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 uti...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/480962 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |