Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Zappala, Julian
Languages: English
Types: Unknown
In this thesis we formalise and study computational aspects of group decision making for rational, self-interested agents. Specifically, we are interested in systems where agents reach consensus according to endogenous thresholds. Natural groups have been shown to make collective decisions according to threshold-mediated behaviours. An individual will commit to some collective endeavour only if the number of others having already committed exceeds their threshold. Consensus is reached only where all individuals express commitment. We present a family of models that describe fundamental aspects of cooperative behaviour in multi-agent systems. These include: coalition formation, participation in joint actions and the achievement of individuals’ goals over time. We associate novel solution concepts with our models and present results concerning the computational complexity of several natural decision problems arising from these. We demonstrate potential applications of our work by modelling a group decision problem common to many cohesive groups: establishing the location of the group. Using model checking tools we compute the effects of agents’ thresholds upon outcomes. We consider our results within an appropriate research context.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • doi: doi:10.1093/jigpal/jzp009. URL http://www.ingentaconnect.com/ content/oup/igpl/2009/00000017/00000003/art00004. 14 N. Alexiou, S. Basagiannis, P. Katsaros, T. Dashpande, and S. Smolka. Formal analysis of the kaminsky dns cache-poisoning attack using probabilistic model checking. In Proc. IEEE 12th International Symposium on High-Assurance Systems Engineering (HASE'10), pages 94-103, 2010. 95 Rajeev Alur and Thomas A Henzinger. Reactive modules. Formal Methods in System Design, 15(1):7-48, 1999. 23 Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time temporal logic. J. ACM, 49(5):672-713, 2002. ISSN 0004-5411. doi: http://doi.acm.org/10.
    • 2007.0186. 94, 127 L. Conradt and T.J. Roper. Conflicts of interest and the evolution of decision sharing.
    • Philosophical Transactions B, 364(1518):807, 2009. 94 Larissa Conradt and Timothy J. Roper. Consensus decision making in animals. Trends in Ecology & Evolution, 20(8):449-456, August 2005.
    • Springer, 2008. 2 BJ Grosz and S. Kraus. Collaborative plans for complex group action. Artificial intelligence, 86(2):269-357, 1996. 16, 62 B.J. Grosz and S. Kraus. The evolution of SharedPlans. Foundations of Rational Agency, 14:227-262, 1999. 15, 16, 62 B.J. Grosz and C.L. Sidner. Plans for discourse. Intentions in Communication, pages 417-444, 1990. 1, 16, 62 Emmanuel Tadjouddine. Complexity of verifying game equilibria. In Hans-Dieter Burkhard, Gabriela Lindemann, Rineke Verbrugge, and Lszl Varga, editors, MultiAgent Systems and Applications V, volume 4696 of Lecture Notes in Computer Science, pages 103-112. Springer Berlin / Heidelberg, 2007. ISBN 978-3-540-75253-0.
    • URL http://dx.doi.org/10.1007/978-3-540-75254-7_11. 46 Milind Tambe. Towards flexible teamwork. CoRR, cs.AI/9709101, 1997. 16, 62 A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5(2):285-309, 1955. 27 M. Wooldridge and N.R. Jennings. Intelligent agents: Theory and practice. Knowledge engineering review, 10(2):115-152, 1995. 1
  • Inferred research data

    The results below are discovered through our pilot algorithms. Let us know how we are doing!

    Title Trust
  • No similar publications.

Share - Bookmark

Cite this article