 |
 |
|
|
|
publications
| Simple models of distributed co-ordination |
|
|
|
|
Kaplan, F. (2005) Simple models of distributed co-ordination, Connection Science, 17 (3-4): 249-270 |
|
Kaplan, F. (2005) Simple models of distributed co-ordination, Connection Science, 17 (3-4): 249-270
Authoritative: http://dx.doi.org/10.1080/09540090500177596
Ingentia Connect: http://www.ingentaconnect.com/content/tandf/ccos/2005/00000017/F0020003/art00005
Cited by (08.2006) Google Scholar (1) ISRL (1)
Abstract:
Distributed co-ordination is the result of dynamical processes enabling
independent agents to co-ordinate their actions without the need of a
central co-ordinator. In the past few years, several computational
models have illustrated the role played by such dynamics for
self-organizing communication systems. In particular, it has been shown
that agents could bootstrap shared convention systems based on simple
local adaptation rules. Such models have played a pivotal role for our
understanding of emergent language processes. However, only few formal
or theoretical results have been published about such systems.
Deliberately simple computational models are discussed in this paper in
order to make progress in understanding the underlying dynamics
responsible for distributed co-ordination and the scaling laws of such
systems. In particular, the paper focuses on explaining the convergence
speed of those models, a largely under-investigated issue. Conjectures
obtained through empirical and qualitative studies of these simple
models are compared with results of more complex simulations and
discussed in relation to theoretical models formalized using Markov
chains, game theory and Polya processes.
Keywords: Self-organizing communication stystems; Scaling laws; Markov chains; Stochastic games; Polya processes
|
|
|
cs05 |
|
|
|
|
 |
|
|
|
|
|
|
|
|
)
