Cooperative profit sharing in coalition based resource allocation in wireless networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 2123-2131

  Aram, Alireza ^a   Singh, Chandramani ^a   Sarkar, Saswati ^a   Kumar, Anurag ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APRIORI; CO-OPERATION STRATEGY; COALITIONAL GAME THEORY; MOBILE CUSTOMER; MULTI-HOP ROUTE; OPERATING POINTS; PROFIT SHARING; SERVICE PROVIDER; STATISTICAL MULTIPLEXING; WIRELESS ACCESS;

AD HOC NETWORKS; BASE STATIONS; COMPUTER RESOURCE MANAGEMENT; CONVEX OPTIMIZATION; CUSTOMER SATISFACTION; ECONOMICS; GAME THEORY; PLANNING; PROFITABILITY; RESOURCE ALLOCATION; SALES;

WIRELESS NETWORKS;

EID: 70349167273     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062136     Document Type: Conference Paper

References (18)

1. I. F. Akyildiz, W.-Y. Lee, M. C. Vuran, and S. Mohanty, "Next generation/dynamic spectrum access/cognitive radio wireless networks: a survey," Computer Networks Journal (Elsevier), vol. 50, pp. 2127-2159, September 2006.
2. M. Osborne and A. Rubinstein, A Course in Game Theory. The MIT press, 1999.
3. V. Conitzer and T. Sandholm, "Complexity of determining nonemptiness of the core," Technical Reprt CS-02-137, CMU, 2002.
4. A. Aram, C. Singh, S. Sarkar, and A. Kumar, "Cooperative profit sharing in coalition based resource allocation in wireless networks," in Technical Report, (http://www.seas.upenn.edu/swati/publication.htm), 2008.
5. D. Hochbaum and J. Shanthikumar, "Convex separable optimization is not much harder than linear optimization," Journal of the Association for Computing Machinery., vol. 37, pp. 843-862, October 1990.
6. X. Lin and N. Shroff, "The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks," in Proceedings of INFOCOM, (Miami, Fl), March 2005.
7. X. Wu and R. Srikant, "Regulated maximal matching: a distributed scheduling algorithm for multihop wireless networks with nodeexclusive spectrum sharing," in Proceedings of IEEE CDC-ECC05, (Seville, Spain), Dec 2005.
8. B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Transactions on Information Theory, vol. 34, no. 5, 1988.
9. H. E. Scarf, "The core of an n person game," Econometrica, vol. 35, pp. 50-69, January 1967.
10. J. E. Suris, L. A. DaSilva, Z. Han, and A. B. MacKenzie, "Cooperative game theory for distributed spectrum sharing," in ICC, 2007.
11. Z. Han and H. V. Poor, "Coalitional games with cooperative transmission: A cure for the curse of boundary nodes in selfish packet-forwarding wireless networks," in 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2007.
12. S. Mathur, L. Sankaranarayanan, and N. Mandayam, "Coalitional games in cooperative radio networks," Fortieth Asilomar Conference on Signals, Systems and Computers, pp. 1927-1931, Oct.-Nov. 2006.
13. S. Sarkar, C. Singh, and A. Kumar, "A coalitional game model for spectrum pooling in wireless data access networks," in Proceedings of 2007 Workshop on Information Theory and Applications (ITA), (UCSD, La Jolla, CA), Jan. 29 - Feb. 2 2008.
14. A. Aram, S. Sarkar, C. Singh, and A. Kumar, "A coalitional game framework for cooperative secondary spectrum access," in Proceedings of 46th Annual Allerton Conference on Communication, Control, and Computing, September 2008.
15. L. S. Shapley and M. Shubik, "The assignment game i: The core," International Journal of Game Theory 1, pp. 111-130, 1972.
16. J. Sanchez-Soriano, M. A. Lopez, and I. Garcia-Jurado, "On the core of transportation games," Mathematical Social Sciences, vol. 41, pp. 215-225, 2001.
17. E. Markakis and A. Saberi, "On the core of the multicommodity flow game," Decision support systems, vol. 39, pp. 3-10, 2005.
18. D. Samet and E. Zamel, "On the core and dual set of linear programming games," Mathematics of Operations Research, vol. 9, pp. 309-316, May 1984