NETWORK FORMATION GAMES BASED ON CONDITIONAL INDEPENDENCE GRAPHS

被引:0
|
作者
Barbarossa, Sergio [1 ]
Di Lorenzo, Paolo [1 ]
van der Schaar, Mihaela [2 ]
机构
[1] Sapienza Univ Rome, DIET, Via Eudossiana 18, I-00184 Rome, Italy
[2] UCLA, EE Dept, Los Angeles, CA USA
关键词
Network formation game; Markov graphs; ECONOMIC NETWORKS; LINK FORMATION; MODEL;
D O I
暂无
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
The goal of this paper is to propose a network formation game where strategic agents decide whether to form or sever a link with other agents depending on the net balance between the benefit resulting from the additional information coming from the new link and the cost associated to establish the link. Differently from previous works, where the benefits are functions of the distances among the involved agents, in our work the benefit is a function of the mutual information that can be exchanged among the agents, conditioned to the information already available before setting up the link. An interesting result of our network formation game is that, under certain conditions, the final network topology tends to match the topology of the Markov graph describing the conditional independencies among the random variables observed in each node, at least when the cost of forming a link is small.
引用
收藏
页码:2944 / 2948
页数:5
相关论文
共 50 条
  • [41] On Network Formation Games with Heterogeneous Players and Basic Network Creation Games
    Kaklamanis, Christos
    Kanellopoulos, Panagiotis
    Tsokana, Sophia
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2016, 9778 : 125 - 136
  • [42] Learning biological network using mutual information and conditional independence
    Kim, Dong-Chul
    Wang, Xiaoyu
    Yang, Chin-Rang
    Gao, Jean
    BMC BIOINFORMATICS, 2010, 11
  • [43] Conditional independence, conditional mixing and conditional association
    Rao, B. L. S. Prakasa
    ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 2009, 61 (02) : 441 - 460
  • [44] Possibilistic conditional independence: A similarity-based measure and its application to causal network learning
    Sanguesa, R
    Cabos, J
    Cortes, U
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 1998, 18 (1-2) : 145 - 167
  • [45] Estimation of graphical models whose conditional independence graphs are interval graphs and its application to modelling linkage disequilibrium
    Thomas, Alun
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2009, 53 (05) : 1818 - 1828
  • [46] Coloring Triangle-Free Graphs and Network Games
    University of California, San Diego
  • [47] Identification of vector AR models with recursive structural errors using conditional independence graphs
    Reale M.
    Wilson G.T.
    Statistical Methods and Applications, 2001, 10 (1-3) : 49 - 65
  • [48] The Research on Formation Process of Business Incubation Network Based on Games Mechanism
    Zhang Min
    Hu Haiqing
    Zhang Daohong
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 5808 - +
  • [49] CONDITIONAL-INDEPENDENCE IN VALUATION-BASED SYSTEMS
    SHENOY, PP
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 1994, 10 (03) : 203 - 234
  • [50] A Permutation-Based Kernel Conditional Independence Test
    Doran, Gary
    Muandet, Krikamol
    Zhang, Kun
    Scholkoepf, Bernhard
    UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, 2014, : 132 - 141