Codes, lower bounds, and phase transitions in the symmetric rendezvous problem

DOI10.1002/rsa.20691zbMath1352.05127arXiv1609.01582OpenAlexW2963373206MaRDI QIDQ2953697

Alexander Russell, Varsha Dani, Moore, Cristopher, Thomas P. Hayes

Publication date: 5 January 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.01582

zbMATH Keywords

search gamespermanentssubmodular functions

Mathematics Subject Classification ID

Search theory (90B40) Games involving graphs (91A43) Dynamic programming (90C39) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks

Cites Work

• A new approach to Gal's theory of search games on weakly Eulerian networks
• Hamiltonian paths in Cayley graphs
• The theory of search games and rendezvous.
• Optimal Symmetric Rendezvous Search on Three Locations
• The rendezvous problem on discrete locations
• Unnamed Item
• Unnamed Item