Utilize este identificador para referenciar este registo:
http://hdl.handle.net/11144/3432
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Silvestre, Daniel | - |
dc.date.accessioned | 2018-02-07T20:52:58Z | - |
dc.date.available | 2018-02-07T20:52:58Z | - |
dc.date.issued | 2015-07 | - |
dc.identifier.uri | http://hdl.handle.net/11144/3432 | - |
dc.description.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. | por |
dc.language.iso | eng | por |
dc.rights | openAccess | por |
dc.title | Finite-time Convergence Policies in State-dependent Social Networks | por |
dc.type | lecture | por |
Aparece nas colecções: | AUTONOMA TECHLAB - Comunicações em conferências |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
ACC2015.pdf | 1,23 MB | Adobe PDF | Ver/Abrir |
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.