Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Patris, Nikolas"'
We consider the problem of computing Nash equilibria in potential games where each player's strategy set is subject to private uncoupled constraints. This scenario is frequently encountered in real-world applications like road network congestion game
Externí odkaz:
http://arxiv.org/abs/2402.07797
Fictitious Play (FP) is a simple and natural dynamic for repeated play with many applications in game theory and multi-agent reinforcement learning. It was introduced by Brown (1949,1951) and its convergence properties for two-player zero-sum games w
Externí odkaz:
http://arxiv.org/abs/2310.02387
Autor:
Fotakis, Dimitris, Gergatsouli, Evangelia, Gouleakis, Themis, Patris, Nikolas, Tolias, Thanos
We consider Online Facility Location in the framework of learning-augmented online algorithms. In Online Facility Location (OFL), demands arrive one-by-one in a metric space and must be (irrevocably) assigned to an open facility upon arrival, without
Externí odkaz:
http://arxiv.org/abs/2107.08277
Following the research agenda initiated by Munoz & Vassilvitskii [1] and Lykouris & Vassilvitskii [2] on learning-augmented online algorithms for classical online optimization problems, in this work, we consider the Online Facility Location problem u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c7d34258b693c5afa84fce73d2838d3
http://arxiv.org/abs/2107.08277
http://arxiv.org/abs/2107.08277