Finding uniform strategies for multi-agent systems

Authors:
Jan Calta;Dmitry Shkatov;Holger Schlingloff
Affiliations:
Humboldt University, Berlin, Germany;University of the Witwatersrand, Johannesburg, South Africa;Humboldt University, Berlin, Germany
Venue:
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Year:
2010

Citing 5
Cited 1

Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM
Alternating-time temporal logic

Journal of the ACM (JACM)
The worst-case time complexity for generating all maximal cliques and computational experiments

Theoretical Computer Science - Computing and combinatorics
Modular interpreted systems

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Tableau-based decision procedures for logics of strategic ability in multiagent systems

ACM Transactions on Computational Logic (TOCL)

Synthesizing strategies for homogenous multi-agent systems with incomplete information

CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for finding uniform strategies in multi-agent systems with incomplete information. The algorithm finds all maximal uniform strategies for agents with incomplete information for enforcing a property expressible in the language of Alternating-time Temporal Logic ATL. The main application of the algorithm is automated program synthesis for systems that can be modeled as multi-agent systems with incomplete information (e.g., decentralized distributed systems).