Zobrazeno 1 - 10
of 123
pro vyhledávání: '"Gairing, Martin"'
In this work we study the power and limitations of fair interventions in weighted congestion games. Specifically, we focus on interventions that aim at improving the equilibrium quality (price of anarchy) and are fair in a suitably defined sense. Wit
Externí odkaz:
http://arxiv.org/abs/2311.16760
Autor:
Paccagnan, Dario, Gairing, Martin
In this work, we consider the problem of minimising the social cost in atomic congestion games. For this problem, we provide tight computational lower bounds along with taxation mechanisms yielding polynomial time algorithms with optimal approximatio
Externí odkaz:
http://arxiv.org/abs/2105.07480
The field of Human Activity Recognition (HAR) focuses on obtaining and analysing data captured from monitoring devices (e.g. sensors). There is a wide range of applications within the field; for instance, assisted living, security surveillance, and i
Externí odkaz:
http://arxiv.org/abs/2005.07308
Autor:
Christodoulou, George, Gairing, Martin, Giannakopoulos, Yiannis, Poças, Diogo, Waldmann, Clara
We study the existence of approximate pure Nash equilibria ($\alpha$-PNE) in weighted atomic congestion games with polynomial cost functions of maximum degree $d$. Previously it was known that $d$-approximate equilibria always exist, while nonexisten
Externí odkaz:
http://arxiv.org/abs/2002.07466
We give exponential lower bounds on the Price of Stability (PoS) of weighted congestion games with polynomial cost functions. In particular, for any positive integer $d$ we construct rather simple games with cost functions of degree at most $d$ which
Externí odkaz:
http://arxiv.org/abs/1802.09952
We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportio
Externí odkaz:
http://arxiv.org/abs/1710.01634
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 2 (April 22, 2021) lmcs:5425
We study the problem of deciding the winner of reachability switching games for zero-, one-, and two-player variants. Switching games provide a deterministic analogue of stochastic games. We show that the zero-player case is NL-hard, the one-player c
Externí odkaz:
http://arxiv.org/abs/1709.08991
Autor:
Christodoulou, George, Gairing, Martin, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul
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 feedback from the channel only when she attempts transmission. In this case s
Externí odkaz:
http://arxiv.org/abs/1707.01439
Autor:
Christodoulou, George, Gairing, Martin, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul
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 channel only when she attempts transmission. In this case she will learn
Externí odkaz:
http://arxiv.org/abs/1606.06580