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 条