Pages that link to "Item:Q1416614"
From MaRDI portal
The following pages link to The theory of search games and rendezvous. (Q1416614):
Displayed 23 items.
- Deterministic symmetric rendezvous with tokens in a synchronous torus (Q540154) (← links)
- A foraging problem: sit-and-wait versus active predation (Q621674) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Search for an immobile entity on a network (Q933506) (← links)
- Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
- Equilibria of two-sided matching games with common preferences (Q1041991) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Weighted search games (Q2378340) (← links)
- A common notion of clockwise can help in planar rendezvous (Q2433433) (← links)
- Map construction of unknown graphs by multiple agents (Q2456354) (← links)
- Line-of-sight rendezvous (Q2475830) (← links)
- Online searching with turn cost (Q2503358) (← links)
- Searching symmetric networks with Utilitarian-Postman paths (Q3057096) (← links)
- Black Hole Search in Directed Graphs (Q3408170) (← links)
- Technical note: Find a hidden “treasure” (Q3442877) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
- Asynchronous Deterministic Rendezvous on the Line (Q3599098) (← links)
- A Jamming Game in Wireless Networks with Transmission Cost (Q3614955) (← links)
- A cooperative game in search theory (Q3621934) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
- Rendezvous Search with Revealed Information: Applications to the Line (Q5443698) (← links)
- Mobile Agent Rendezvous in a Ring Using Faulty Tokens (Q5445769) (← links)