Controlled Coalitional Games for Cooperative Mobile Social Networks

被引:32
|
作者
Niyato, Dusit [1 ]
Wang, Ping [1 ]
Saad, Walid [2 ]
Hjorungnes, Are [3 ]
机构
[1] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore
[2] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[3] Univ Oslo, Fac Math & Nat Sci, UNIK Univ Grad Ctr, N-0316 Oslo, Norway
关键词
Coalitional game; content provider; game theory; mobile social network;
D O I
10.1109/TVT.2011.2116816
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Mobile social networks have been introduced as a new efficient (i.e., minimizing bandwidth usage) and effective (i.e., minimizing the delay or maximizing the number of target recipients) way of disseminating content and information to a particular group of mobile users who share similar interests. In this paper, we investigate how the content providers and the network operator can interact to distribute content in a mobile social network. The objective of each content provider is to minimize the cost that pertains to the time used to distribute the content to the subscribed mobile users and the cost due to the price paid to the network operator for transferring the content over a wireless connection through a base station. Although the content providers can cooperate by forming coalitions for sharing a wireless connection, the network operator can control the amount of bandwidth provided over the wireless connection. We introduce a novel coalitional game model, which is referred to as the controlled coalitional game, to investigate the decision-making process of the content providers and the network operator. Numerical studies show that, given the allocated bandwidth from the network operator, the content providers can self organize into coalitions while minimizing their individual cost. In addition, the results demonstrate that the revenue of the network operator can be maximized when the bandwidth allocation is performed while considering the coalitional structure of the content providers.
引用
收藏
页码:1812 / 1824
页数:13
相关论文
共 50 条
  • [1] Coalitional games in cooperative radio networks
    Mathur, Suhas
    Sankaranarayanan, Lalitha
    Mandayam, Narayan B.
    2006 FORTIETH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-5, 2006, : 1927 - +
  • [2] Coalitional Games on Sparse Social Networks
    Elkind, Edith
    WEB AND INTERNET ECONOMICS, 2014, 8877 : 308 - 321
  • [3] Coalitional games on sparse social networks
    Elkind, Edith
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8877 : 308 - 321
  • [4] Manipulation of k-Coalitional Games on Social Networks
    Waxman, Naftali
    Kraus, Sarit
    Hazon, Noam
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 450 - 457
  • [5] A Controlled Coalitional Game for Wireless Connection Sharing and Bandwidth Allocation in Mobile Social Networks
    Niyato, Dusit
    Han, Zhu
    Saad, Walid
    Hjorungnes, Are
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [6] Coalitional stability and rationality in cooperative games
    Stefanescu, A
    KYBERNETIKA, 1996, 32 (05) : 483 - 490
  • [7] A coalitional compromised solution for cooperative games
    Zou, Rong
    Xu, Genjiu
    Li, Wenzhong
    Hu, Xunfeng
    SOCIAL CHOICE AND WELFARE, 2020, 55 (04) : 735 - 758
  • [8] k-Coalitional Cooperative Games
    Skibski, Oskar
    Matejczyk, Szymon
    Michalak, Tomasz P.
    Wooldridge, Michael
    Yokoo, Makoto
    AAMAS'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2016, : 177 - 185
  • [9] A coalitional compromised solution for cooperative games
    Rong Zou
    Genjiu Xu
    Wenzhong Li
    Xunfeng Hu
    Social Choice and Welfare, 2020, 55 : 735 - 758
  • [10] Overlapping community detection in social networks using coalitional games
    Jonnalagadda, Annapurna
    Kuppusamy, Lakshmanan
    KNOWLEDGE AND INFORMATION SYSTEMS, 2018, 56 (03) : 637 - 661