A Game Theoretical Approach for Resource Bargaining in Shared WCDMA Networks: Symmetric and Asymmetric Models

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Hew, Siew-Lee en_AU
dc.contributor.author White, Langford B. en_AU
dc.date.accessioned 2007-03-12T22:05:46Z
dc.date.accessioned 2012-12-15T02:29:32Z
dc.date.available 2007-03-12T22:05:46Z
dc.date.available 2012-12-15T02:29:32Z
dc.date.issued 2007-03-12T22:05:46Z
dc.identifier.uri http://hdl.handle.net/2100/150
dc.identifier.uri http://hdl.handle.net/10453/19596
dc.description.abstract The high cost associated with the rollout of 3G services encourages operators to share network infrastructure. Network sharing poses a new challenge in devising fair, efficient and Pareto optimal resource allocation strategies to distribute system resources among users of different operators in the network. Cooperative game theory provides a framework for formulating such strategies. In this paper, we propose two models (i.e. symmetric and asymmetric) for cooperative resource bargaining in shared networks based on the concept of preference functions. The symmetric model assumes that all players have equal bargaining powers while in the asymmetric case, players are allowed to submit bids to the network operator to influence the final bargaining outcome. The bargaining solutions proposed vary according to a parameter ¯ that considers the tradeoff between one's gain and the losses of others. The well-known Nash and Raiffa-Kalai-Smorodinsky solutions are special instances of the solutions proposed. en_AU
dc.format.extent 129683 bytes
dc.format.mimetype application/pdf
dc.language.iso en_AU
dc.title A Game Theoretical Approach for Resource Bargaining in Shared WCDMA Networks: Symmetric and Asymmetric Models en_AU


Files in this item

This item appears in the following Collection(s)

Show simple item record