A new bandwidth allocationmodel is studied in this paper. In thismodel, a system, such as a communication network, is composedof a finite number of users, and they compete for limited bandwidth resources. Each user adopts the decision that maximizes hisor 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 utilityfunction satisfies some continuity and concavity conditions, the existence, uniqueness, and fairness, in some appropriate sense, ofthe Nash equilibrium point in the allocation game are proved. An algorithm yielding a sequence converging to the equilibriumpoint is proposed. Finally, a numerical example with detailed analysis is provided to illustrate the effectiveness of our work
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.