2026-08-12T10:10:56Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16810 2024-03-06T10:58:23Z ddc:004 open_access

Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs Auger, David Coucheney, Pierre Duhazé, Loric Rotor-routing Rotor Walk Reachability Problem Game Theory Tree-like Multigraph A rotor walk in a directed graph can be thought of as a deterministic version of a Markov Chain, where a pebble moves from vertex to vertex following a simple rule until a terminal vertex, or sink, has been reached. The ARRIVAL problem, as defined by Dohrau et al. [Dohrau et al., 2017], consists in determining which sink will be reached. While the walk itself can take an exponential number of steps, this problem belongs to the complexity class NP ∩ co-NP without being known to be in P. In this work, we define a class of directed graphs, namely tree-like multigraphs, which are multigraphs having the global shape of an undirected tree. We prove that in this class, ARRIVAL can be solved in almost linear time, while the number of steps of a rotor walk can still be exponential. Then, we give an application of this result to solve some deterministic analogs of stochastic models (e.g., Markovian decision processes, Stochastic Games). Schloss Dagstuhl – Leibniz-Zentrum für Informatik David Auger and Pierre Coucheney and Loric Duhazé 2022 Is Part Of LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2022.12 urn:nbn:de:0030-drops-168103 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.12 eng https://creativecommons.org/licenses/by/4.0/legalcode