Quantized Dissensus in Networks of Agents Subject to Death and Duplication

被引:15
作者
Bauso, Dario [1 ]
Giarre, Laura [2 ]
Pesenti, Raffaele [3 ]
机构
[1] Univ Palermo, DICGIM, I-90128 Palermo, Italy
[2] Univ Palermo, DIEETCAM, I-90128 Palermo, Italy
[3] Univ Ca Foscari Venezia, DMA, I-30123 Venice, Italy
关键词
Consensus protocols; network based marketing; quantized control; CONSENSUS; GOSSIP;
D O I
10.1109/TAC.2011.2167810
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Dissensus is a modeling framework for networks of dynamic agents in competition for scarce resources. Originally inspired by biological cell behaviors, it also fits marketing, finance and many other application areas. Competition is often unstable in the sense that strong agents, those having access to large resources, gain more and more resources at the expenses of weak agents. Thus, strong agents duplicate when reaching a critical amount of resources, whereas weak agents die when losing all their resources. To capture all these phenomena we introduce discrete time gossip systems with unstable state dynamics interrupted by discrete events affecting the network topology. Invariancy of states, topologies, and network connectivity are explored.
引用
收藏
页码:783 / 788
页数:6
相关论文
共 18 条
[1]   Distributed average consensus using probabilistic quantization [J].
Aysal, Tuncer C. ;
Coates, Mark ;
Rabbat, Michael .
2007 IEEE/SP 14TH WORKSHOP ON STATISTICAL SIGNAL PROCESSING, VOLS 1 AND 2, 2007, :640-644
[2]   Distributed average consensus with dithered quantization [J].
Aysal, Tuncer Can ;
Coates, Mark J. ;
Rabbat, Michael G. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (10) :4905-4918
[3]   Broadcast Gossip Algorithms for Consensus [J].
Aysal, Tuncer Can ;
Yildiz, Mehmet Ercan ;
Sarwate, Anand D. ;
Scaglione, Anna .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2009, 57 (07) :2748-2761
[4]   DISSENSUS, DEATH AND DIVISION [J].
Bauso, D. ;
Giarre, L. ;
Pesenti, R. .
2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9, 2009, :2307-+
[5]   Randomized gossip algorithms [J].
Boyd, Stephen ;
Ghosh, Arpita ;
Prabhakar, Balaji ;
Shah, Devavrat .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2508-2530
[6]   Duplication models for biological networks [J].
Chung, F ;
Lu, LY ;
Dewey, TG ;
Galas, DJ .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2003, 10 (05) :677-687
[7]  
Erdos P., 1959, PUBL MATH-DEBRECEN, V6, P290, DOI DOI 10.5486/PMD.1959.6.3-4.12
[8]   Average consensus by gossip algorithms with quantized communication [J].
Frasca, Paolo ;
Carli, Ruggero ;
Fagnani, Fabio ;
Zampieri, Sandro .
47TH IEEE CONFERENCE ON DECISION AND CONTROL, 2008 (CDC 2008), 2008, :4831-4836
[9]   Lyapunov conditions for input-to-state stability of impulsive systems [J].
Hespanha, Joao P. ;
Liberzon, Daniel ;
Teel, Andrew R. .
AUTOMATICA, 2008, 44 (11) :2735-2744
[10]   Network-based marketing: Identifying likely adopters via consumer networks [J].
Hill, Shawndra ;
Provost, Foster ;
Volinsky, Chris .
STATISTICAL SCIENCE, 2006, 21 (02) :256-276