Trust-based Multiagent Consensus or Weightings Aggregation

We introduce a framework for reaching a consensus amongst several agents communicating via a trust network on conflicting information about their environment. We formalise our approach and provide an empirical and theoretical analysis of its properties.

[1]  R. Berger.  A Necessary and Sufficient Condition for Reaching a Consensus Using DeGroot's Method , 1981 .

[2]  Matthew O. Jackson,et al.  Naïve Learning in Social Networks and the Wisdom of Crowds , 2010 .

[3]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[4]  R. Saravanan,et al.  Selfish node detection based on evidence by trust authority and selfish replica allocation in DANET , 2016, Int. J. Inf. Commun. Technol..

[5]  A. Davie,et al.  Improved bound for complexity of matrix multiplication , 2013, Proceedings of the Royal Society of Edinburgh: Section A Mathematics.

[6]  Paul-Amaury Matt,et al.  A Game-Theoretic Measure of Argument Strength for Abstract Argumentation , 2008, JELIA.

[7]  Sarvapali D. Ramchurn,et al.  Trust in multi-agent systems , 2004, The Knowledge Engineering Review.

[8]  Claudette Cayrol,et al.  Graduality in Argumentation , 2011, J. Artif. Intell. Res..

[9]  Anthony Hunter,et al.  A logic-based theory of deductive arguments , 2001, Artif. Intell..

[10]  M. Degroot.  Reaching a Consensus , 1974 .

[11]  João Leite,et al.  Social Abstract Argumentation , 2011, IJCAI.

[12]  François Le Gall,et al.  Powers of tensors and fast matrix multiplication , 2014, ISSAC.

[13]  Nicolas Maudet,et al.  A Comparative Study of Ranking-Based Semantics for Abstract Argumentation , 2016, AAAI.

[14]  Leila Amgoud,et al.  Ranking-Based Semantics for Argumentation Frameworks , 2013, SUM.