Simple Decentralized Algorithm for Coordination Games Host Publication: 21st Belgian-Dutch Conference on Machine Learning Authors: M. Emilov Mihaylov, K. Tuyls and A. Nowé Publication Date: May. 2012 Number of Pages: 1
Abstract: Many biological or computer systems are comprised
of intelligent, but highly constrained agents with com-
mon objectives that are beyond the capabilities of the
individual. Often such multi-agent systems (MASs)
are inherently decentralized and therefore agents need
to coordinate their behavior in the absence of central
control to achieve their design objectives. Wireless
sensor networks (WSNs) are an example of a decen-
tralized MAS where sensor nodes gather environmen-
tal data and collectively forward it towards the base
station of the observer. The limited resources of such
sensor nodes and the lack of global knowledge make the
design of a WSN application challenging. The main
question we are concerned with is the following: based
only on local interactions and incomplete knowledge
how can the designer of a decentralized system make
agents achieve good collective performance imposing
minimal system requirements and overhead?
|