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

19 papers

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…

math.CO2020

Some Game Theoretic Remarks on Two-Player Generalized Cops and Robbers Games

Athanasios Kehagias, Georgios Konstantinidis

In this paper we study the two-player generalized Cops and Robber (GCR) games introduced by Bonato and MacGillivray. Our main goal is to present a full, self-contained game theoret…

math.CO2019

On positionality of trigger strategies Nash Equilibria in SCAR

George Konstantinidis, Athanasios Kehagias

We study the positionality of \emph{trigger strategies} Nash equilibria for the -player SCAR games (with ). Our study is exha…

cs.GT2018

A Note on the Nash Equilibria of Some Multi-Player Reachability / Safety Games

Athanasios Kehagias

In this short note we study a class of multi-player, turn-based games with deterministic state transitions and reachability / safety objectives (this class contains as special case…

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…