A simple game provides a framework within which agents can spontaneously self-organize. In this paper, we present this game, and develop basic theory underlying a robust method for distributed coordination based on this game. This method makes use of finite state automata-one associated with each agent-which guide the agents. We give a new, general method of analysis of these systems, which previously had been studied only in limited cases. We also provide a physical example, which should hint at the type of problems resolvable using this method.
No takes yet. Share an insight, caveat, or question.
Tung et al. (1996) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: