36 citations · 170 across the 60 of their papers we have counts for
4 papers · 1 filter
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…
Temporal flows in Temporal networks
Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec +2
We introduce temporal flows on temporal networks, i.e., networks the links of which exist only at certain moments of time. Such networks are ephemeral in the sense that no link exi…
How Many Cooks Spoil the Soup?
Othon Michail, Paul G. Spirakis
In this work, we study the following basic question: "How much parallelism does a distributed task permit?" Our definition of parallelism (or symmetry) here is not in terms of spee…
On the Complexity of Weighted Greedy Matchings
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
Motivated by the fact that in several cases a matching in a graph is stable if and only if it is produced by a greedy algorithm, we study the problem of computing a maximum weight…