Abstract
When multiple agents need to perform tasks that need cooperation, communication is necessary for coordination and also to assess completion. In this case, trust needs to be guaranteed, so agents know if others are following a common strategy. If communication is explicit, other agents, including agents that are not involved directly in the mission, can forge information and lead agents to believe that they are behaving according to the mission plan. Several methods have been proposed in the literature, and in this article, we propose a novel method based on interactive proofs in which trust between two agents is asserted by one agent demonstrating to the other that both follow the same mission plan. We formally represent the problem as a series of Markov decision processes and demonstrate that the formulation is complete and sound. Simulations of multiple agents in a maze problem demonstrate the behavior of the system.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
