Social distancing, gathering, search games: mobile agents on simple networks

DOI10.1007/s13235-022-00427-1zbMath1489.92133arXiv2111.05958OpenAlexW3212182230MaRDI QIDQ2128973

Li Zeng, Steven Alpern

Publication date: 22 April 2022

Published in: Dynamic Games and Applications (Search for Journal in Brave)

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

zbMATH Keywords

dispersionMarkov chainrandom walkepidemicrendezvous search

Mathematics Subject Classification ID

Epidemiology (92D30) Sums of independent random variables; random walks (60G50) Applications of game theory (91A80) (n)-person games, (n>2) (91A06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach to Gal's theory of search games on weakly Eulerian networks
• Search games
• The theory of search games and rendezvous.
• Spatial dispersion as a dynamic coordination problem
• Internal and external effects of social distancing in a pandemic
• Decentralized learning from failure
• Rendezvous Search on the Interval and the Circle
• Optimal Symmetric Rendezvous Search on Three Locations
• Rendezvous Search: A Personal Perspective
• Search Games with Mobile and Immobile Hider
• Note: Two rendezvous search problems on the line
• Rendezvous search on a graph
• Rendezvous Search on the Line with More Than Two Players
• Rendezvous search on labeled networks
• Rendezvous Search on the Line
• A search game with one object and two searchers
• The Rendezvous Search Problem
• The rendezvous problem on discrete locations

This page was built for publication: Social distancing, gathering, search games: mobile agents on simple networks