Deterministic treasure hunt and rendezvous in arbitrary connected graphs.

Debasish Pattanayak Andrzej Pelc

Published in: Inf. Process. Lett. (2024)

Keyphrases

connected graphs
black box
social networks
relaxation algorithm
database
case study
reinforcement learning
multi agent
wide range
arbitrary dimension
rendezvous search