Blar i Bergen Open Research Archive på tidsskrift "Information and Computation"
Viser treff 1-1 av 1
-
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
(Journal article; Peer reviewed, 2023)We introduce the rendezvous game with adversaries. In this game, two players, Facilitator and Divider, play against each other on a graph. Facilitator has two agents and Divider has a team of k agents located in some ...