Abstract. Most of multi-agent reinforcement learning algorithms aim to converge to a Nash equilibrium, but a Nash equilibrium does not necessarily mean a desirable result. On the o...
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintve...
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...
Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintve...
We embark on an initial study of a new class of strategic (normal-form) games, so-called ranking games, in which the payoff to each agent solely depends on his position in a ranki...