Skip to Main content Skip to Navigation
Journal articles

On mobile agent verifiable problems

Abstract : We consider decision problems that are solved in a distributed fashion by synchronous mobile agents operating in an unknown, anonymous network. Each agent has a unique identifier and an input string and they have to decide collectively a property which may involve their input strings, the graph on which they are operating, and their particular starting positions. Building on recent work by Fraigniaud and Pelc [J. Parallel Distrib. Comput, vol. 109, pp. 117–128], we introduce several natural new computability classes allowing for a finer classification of problems below MAV or its complement class co-MAV, the former being the class of problems that are verifiable when the agents are provided with an appropriate certificate. We provide inclusion and separation results among all these classes. We also determine their closure properties with respect to set-theoretic operations. Our main technical tool, which is of independent interest, is a new meta-protocol that enables the execution of a possibly infinite number of mobile agent protocols essentially in parallel, similarly to the well-known dovetailing technique from classical computability theory.
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download
Contributor : David Ilcinkas Connect in order to contact the contributor
Submitted on : Thursday, June 21, 2018 - 3:51:59 PM
Last modification on : Saturday, December 4, 2021 - 3:06:38 AM
Long-term archiving on: : Tuesday, September 25, 2018 - 7:58:53 AM


Files produced by the author(s)




Evangelos Bampas, David Ilcinkas. On mobile agent verifiable problems. Information and Computation, Elsevier, 2018, 260, pp.51 - 71. ⟨10.1016/j.ic.2018.03.003⟩. ⟨hal-01820407⟩



Record views


Files downloads