Author of the publication

Graph Patterns, Reinforcement Learning and Models of Reputation for Improving Coalition Formation in Collaborative Multi-agent Systems.

. EUMAS/AT, volume 9571 of Lecture Notes in Computer Science, page 74-81. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

G-Model: A Novel Approach to Privacy-Preserving 1: M Microdata Publication., , and . CSCloud/EdgeCom, page 88-99. IEEE, (2020)On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata., and . UC, volume 3699 of Lecture Notes in Computer Science, page 191-205. Springer, (2005)Some Challenges in Studying Resource-Bounded Autonomous Agents in Complex Multi-Agent Environments.. IKE, page 438-444. CSREA Press, (2010)Counting Fixed Points and Gardens of Eden of Sequential Dynamical Systems on Planar Bipartite Graphs.. Electron. Colloquium Comput. Complex., (2005)On Modeling and Analyzing Sparsely Networked Large-Scale Multi-agent Systems with Cellular and Graph Automata.. International Conference on Computational Science (3), volume 3993 of Lecture Notes in Computer Science, page 272-280. Springer, (2006)Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems, and . Massively Multi-Agent Systems I, volume 3446 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2005)Strategies for Challenging Two-player Games - Some Lessons from Iterated Traveler's Dilemma., and . ICAART (2), page 72-82. SciTePress, (2012)Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems., and . MMAS, volume 3446 of Lecture Notes in Computer Science, page 104-120. Springer, (2004)On Counting Fixed Point Configurations in Star Networks.. IPDPS, IEEE Computer Society, (2005)On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rules.. Automata, volume AL of Discrete Mathematics and Theoretical Computer Science Proceedings, page 125-144. DMTCS, (2010)