3 papers
cs.CC2019
How fast can we reach a target vertex in stochastic temporal graphs?
Eleni C. Akrida, George B. Mertzios, Sotiris Nikoletseas +3
Temporal graphs are used to abstractly model real-life networks that are inherently dynamic in nature. Given a static underlying graph , a temporal graph on is a seque…
cs.GT2017
A 3-player protocol preventing persistence in strategic contention with limited feedback
George Christodoulou, Martin Gairing, Sotiris Nikoletseas +2
In this paper, we study contention resolution protocols from a game-theoretic perspective. In a recent work, we considered acknowledgment-based protocols, where a user gets feedbac…
cs.GT2016
Strategic Contention Resolution with Limited Feedback
George Christodoulou, Martin Gairing, Sotiris Nikoletseas +2
In this paper, we study contention resolution protocols from a game-theoretic perspective. We focus on \emph{acknowledgment-based} protocols, where a user gets feedback from the ch…