Synthesizing Strategies for Homogenous Multi-Agent Systems with Incomplete Information
We present an algorithm for synthesizing strategies for multi-agent systems composed of homogeneous agents possessing incomplete information about the system as a whole. The algorithm finds all maximal strategies for such agents that enforce a certain property of the system. In contrast to other algorithms known from the literature, our algorithm can be used for automated program synthesis for systems in which agents are required to be homogeneous (i.e., every agent has to follow the same strategy), which is a more restrictive setting.
Unable to display preview. Download preview PDF.
- 6.Jamroga, W., Ågotnes, T.: Modular interpreted systems. In: AAMAS 2007: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1–8. ACM, New York (2007)Google Scholar