Searching for a non-adversarial, uncooperative agent on a cycle
From MaRDI portal
Publication:2285151
DOI10.1016/J.TCS.2019.08.031zbMATH Open1436.68042OpenAlexW2970627438MaRDI QIDQ2285151FDOQ2285151
Authors: Stefan Dobrev, Maxime Godon, Evangelos Kranakis, Toshinori Sakai, J. Urrutia, Jurek Czyzowicz 
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.08.031
Recommendations
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle
- Noncooperative n-player cyclic stopping games
- On cyclic and nearly cyclic multiagent interactions in the plane
- A Unified Strategy for Solution Seeking in Graphical $N$-Coalition Noncooperative Games
- Nash Equilibrium Seeking in Noncooperative Games
- A cooperative game in search theory
- Non-cooperative stochastic adaptive multi-player games
- scientific article
Cites Work
- Searching in the plane
- The theory of search games and rendezvous.
- Gathering asynchronous oblivious mobile robots in a ring
- The game of cops and robbers on graphs
- Gathering of asynchronous robots with limited visibility
- Theory of optimal search
- Title not available (Why is that?)
- On the linear search problem
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Evacuating robots via unknown exit in a disk
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Collaboration without communication: evacuating two robots from a disk
- Different speeds suffice for rendezvous of two agents on arbitrary graphs
Cited In (3)
This page was built for publication: Searching for a non-adversarial, uncooperative agent on a cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285151)
