DeepAI AI Chat
Log In Sign Up

The Stochastic Arrival Problem

by   Thomas Webster, et al.

We study a new modification of the Arrival problem, which allows for nodes that exhibit random as well as controlled behaviour, in addition to switching nodes. We study the computational complexity of these extensions, building on existing work on Reachability Switching Games. In particular, we show for versions of the arrival problem involving just switching and random nodes it is -hard to decide if their value is greater than a half and we give a PSPACE decision algorithm.


page 1

page 2

page 3

page 4


Reachability Switching Games

In this paper, we study the problem of deciding the winner of reachabili...

A Subexponential Algorithm for ARRIVAL

The ARRIVAL problem is to decide the fate of a train moving along the ed...

Non-Parametric Stochastic Sequential Assignment With Random Arrival Times

We consider a problem wherein jobs arrive at random times and assume ran...

ARRIVAL: Next Stop in CLS

We study the computational complexity of ARRIVAL, a zero-player game on ...

Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets

We analyze the computational complexity of motion planning through local...

A simple lower bound for ARRIVAL

The ARRIVIAL problem introduced by Dohrau, Gärtner, Kohler, Matoušek and...