Pages that link to "Item:Q4598639"
From MaRDI portal
The following pages link to Hide-and-Seek Games on a Network, Using Combinatorial Search Paths (Q4598639):
Displayed 9 items.
- A search problem on a bipartite network (Q1735184) (← links)
- Failure of common knowledge of language in common-interest communication games (Q1753280) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Search for an immobile hider on a stochastic network (Q2286995) (← links)
- Search for an immobile hider in a known subset of a network (Q2328862) (← links)
- Rendezvous search with markers that can be dropped at chosen times (Q3120081) (← links)
- A Multi-Stage Model of Searching for Two Mobile Objects on a Graph (Q5118428) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)