25 citations · 57 across the 24 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Tight bounds for undirected graph exploration with pebbles and multiple agents
Yann Disser, Jan Hackfeld, Max Klimm
We study the problem of deterministically exploring an undirected and initially unknown graph with vertices either by a single agent equipped with a set of pebbles, or by a set…
math.PR2018
Approximate lumpability for Markovian agent-based models using local symmetries
Wasiur R. KhudaBukhsh, Arnab Auddy, Yann Disser +1
We study a Markovian agent-based model (MABM) in this paper. Each agent is endowed with a local state that changes over time as the agent interacts with its neighbours. The neighbo…