Please use this identifier to cite or link to this item:
http://hdl.handle.net/11144/3432
Title: | Finite-time Convergence Policies in State-dependent Social Networks |
Authors: | Silvestre, Daniel |
Issue Date: | Jul-2015 |
Abstract: | This paper addresses the problem of finite-time convergence in a social network for a political party or an association, modeled as a distributed iterative system with a graph dynamics chosen to mimic how people interact. It is firstly shown that, in this setting, finite-time convergence is achieved only when nodes form a complete network, and that contacting with agents with distinct opinions reduces to a half the required interconnections. Two novel strategies are presented that enable finite-time convergence, even for the case where each node only contacts the two closest neighbors. These strategies are of prime importance, for instance, in a company environment where agents can be motivated to reach faster conclusions. The performance of the proposed policies is assessed through simulation, illustrating, in particular the finite-time convergence property. |
URI: | http://hdl.handle.net/11144/3432 |
Appears in Collections: | AUTONOMA TECHLAB - Comunicações em conferências |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ACC2015.pdf | 1,23 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.