Bandwidth allocation in wireless access networks: Bankruptcy game vs cooperative game

Vassaki, S; Panagopoulos, AD; Constantinou, P

dc.contributor.author	Vassaki, S	en
dc.contributor.author	Panagopoulos, AD	en
dc.contributor.author	Constantinou, P	en
dc.date.accessioned	2014-03-01T02:45:58Z
dc.date.available	2014-03-01T02:45:58Z
dc.date.issued	2009	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32497
dc.subject	Bandwidth allocation	en
dc.subject	Bankruptcy rules	en
dc.subject	Nash bargaining	en
dc.subject	Resource management	en
dc.subject.other	Bandwidth allocations	en
dc.subject.other	Cooperative game	en
dc.subject.other	Cooperative game theory	en
dc.subject.other	Nash bargaining	en
dc.subject.other	Optimal solutions	en
dc.subject.other	Resource management	en
dc.subject.other	Wireless access networks	en
dc.subject.other	Bandwidth	en
dc.subject.other	Game theory	en
dc.subject.other	Natural resources management	en
dc.subject.other	Resource allocation	en
dc.subject.other	Wireless networks	en
dc.title	Bandwidth allocation in wireless access networks: Bankruptcy game vs cooperative game	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ICUMT.2009.5345418	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ICUMT.2009.5345418	en
heal.identifier.secondary	5345418	en
heal.publicationDate	2009	en
heal.abstract	In this paper, we study the problem of bandwidth allocation in wireless networks using two different approaches. More specifically, we apply the principles of cooperative game theory, such as Nash bargaining and three basic division rules of bankruptcy problems in order to find the optimal solution of the bandwidth allocation problem. The proposed schemes are compared in terms of fairness and of the maximum total capacity of the wireless network with a view to highlighting the advantages and disadvantages of every approach. ©2009 IEEE.	en
heal.journalName	2009 International Conference on Ultra Modern Telecommunications and Workshops	en
dc.identifier.doi	10.1109/ICUMT.2009.5345418	en