activity
20012023
most citedSearching the Nodes of a Graph: Theory and Algorithms

8 citations · 33 across the 13 of their papers we have counts for

collaborators
Showing cs.DMShow all

10 papers · 1 filter

cs.DM2023

On the Nash Equilibria of a Simple Discounted Duel

Athanasios Kehagias

We formulate and study a two-player static duel game as a nonzero-sum discounted stochastic game. Players are standing in place and, in each turn, one or both may sho…

cs.DM2021★ 3 cited

An Algorithm for Limited Visibility Graph Searching

Ath. Kehagias, A. C. Papazoglou

We study a graph search problem in which a team of searchers attempts to find a mobile target located in a graph. Assuming that (a) the visibility field of the searchers is limited…

cs.DM2017★ 1 cited

Selfish Cops and Active Robber: Multi-Player Pursuit Evasion on Graphs

G. Konstantinidis, Ath. Kehagias

We introduce and study the game of "Selfish Cops and Active Robber" (SCAR) which can be seen as an multiplayer variant of the "classic" two-player Cops and Robbers (CR) game. In cl…

cs.DM2016

Selfish Cops and Passive Robber: Qualitative Games

Athanasios Kehagias, Georgios Konstantinidis

Several variants of the cops and robbers (CR) game have been studied in the past. In this paper we examine a novel variant, which is played between two cops, each one independently…

cs.DM2015

Simultaneously Moving Cops and Robbers

Georgios Konstantinidis, Athanasios Kehagias

In this paper we study the concurrent cops and robber (CCCR) game. CCCR follows the same rules as the classical, turn-based game, except for the fact that the players move simultan…

cs.DM2014★ 5 cited

Cops and Robbers, Game Theory and Zermelo's Early Results

Athanasios Kehagias, Georgios Konstantinidis

We provide a game theoretic framework for the game of cops and robbers (CR). Within this framework we study certain assumptions which underlie the concepts of optimal strategies an…