A coalitional game model for spectrum pooling in wireless data access networks

We consider a setting in which several operators offer downlink wireless data access services in a certain geographical region. Each operator deploys several base stations or access points, and registers some subscribers. In such a situation, if operators pool their infrastructure, and permit the possibility of subscribers being served by any of the cooperating operators, then there can be overall better user satisfaction, and increased operator revenue. We use coalitional game theory to investigate such resource pooling and cooperation between operators.We use utility functions to model user satisfaction, and show that the resulting coalitional game has the property that if all operators cooperate (i.e., form a grand coalition) then there is an operating point that maximizes the sum utility over the operators while providing the operators revenues such that no subset of operators has an incentive to break away from the coalition. We investigate whether such operating points can result in utility unfairness between users of the various operators. We also study other revenue sharing concepts, namely, the nucleolus and the Shapely value. Such investigations throw light on criteria for operators to accept or reject subscribers, based on the service level agreements proposed by them. We also investigate the situation in which only certain subsets of operators may be willing to cooperate.

[1]  Gur Huberman,et al.  The nucleolus and the essential coalitions , 1980 .

[2]  Evangelos Markakis,et al.  On the core of the multicommodity flow game , 2003, EC '03.

[3]  Marco A. López,et al.  On the core of transportation games , 2001, Math. Soc. Sci..

[4]  Thomas Quint On One-Sided versus Two-Sided Matching Games , 1996 .

[5]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[6]  Eitan Altman,et al.  Multihoming of Users to Access Points in WLANs: A Population Game Perspective , 2007, IEEE Journal on Selected Areas in Communications.

[7]  Eitan Altman,et al.  Some Game-Theoretic Problems in Wireless Ad-Hoc Networks , 2004, EuroNGI Workshop.

[8]  L. Shapley,et al.  The assignment game I: The core , 1971 .

[9]  Vahab S. Mirrokni,et al.  On spectrum sharing games , 2004, PODC '04.

[10]  S. Tijs,et al.  Assignment games and permutation games , 1986 .

[11]  Jean-Pierre Hubaux,et al.  Wireless Operators in a Shared Spectrum , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[12]  Friedrich Jondral,et al.  Spectrum pooling: an innovative strategy for the enhancement of spectrum efficiency , 2004, IEEE Communications Magazine.

[13]  Abhay Parekh,et al.  Spectrum sharing for unlicensed bands , 2005, IEEE Journal on Selected Areas in Communications.

[14]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[15]  Vincent Conitzer,et al.  Complexity of determining nonemptiness of the core , 2003, EC '03.

[16]  Zhu Han,et al.  Cooperative Game Theory for Distributed Spectrum Sharing , 2007, 2007 IEEE International Conference on Communications.

[17]  A. Rubinstein,et al.  A Course in Game Theory , 1995 .

[18]  Dov Samet,et al.  On the Core and Dual Set of Linear Programming Games , 1984, Math. Oper. Res..

[19]  Stefan M. Stefanov,et al.  Convex separable minimization problems with a linear constraint and bounded variables , 2005, International Journal of Mathematics and Mathematical Sciences.

[20]  N.B. Mandayam,et al.  Coalitional Games in Cooperative Radio Networks , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[21]  Zhu Han,et al.  Coalition Games with Cooperative Transmission: A Cure for the Curse of Boundary Nodes in Selfish Packet-Forwarding Wireless Networks , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.

[22]  Xiaotie Deng,et al.  Membership for Core of LP Games and Other Games , 2001, COCOON.