Abstract
A simple multi-agent system which participated in the Multi-Agent Programming Contest in association with ProMAS 2008 is described. Agents take actions in order to maximize a global utility function from at each step. Coordination is done via the max-plus algorithm or by the greedy strategy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Vlassis, N., Elhorst, R., Kok, J.R.: Anytime algorithms for multiagent decision making using coordination graphs. In: Proc. Intl. Conf. on Systems, Man and Cybernetics (2004)
Vlassis, N.: A Concise Introduction to Multiagent Systems and Distributed Artificial Intelligence. Morgan and Claypool (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szklarski, J. (2009). AC08 System Description. In: Hindriks, K.V., Pokahr, A., Sardina, S. (eds) Programming Multi-Agent Systems. ProMAS 2008. Lecture Notes in Computer Science(), vol 5442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03278-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-03278-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03277-6
Online ISBN: 978-3-642-03278-3
eBook Packages: Computer ScienceComputer Science (R0)