Following the remarkable success of the AlphaGO series, 2019 was a booming year that
witnessed significant advances in multi-agent reinforcement learning (MARL) techniques …

This paper provides a survey of prediction, and forecasting methods used in cyber security.
Four main tasks are discussed first, attack projection and intention recognition, in which …

Cyber–physical systems (CPSs) are complex systems that involve technologies such as
control, communication, and computing. Nowadays, CPSs have a wide range of applications …

We show that computing approximate stationary Markov coarse correlated equilibria (CCE)
in general-sum stochastic games is PPAD-hard, even when there are two players, the game …

How long does it take until economic agents converge to an equilibrium? By studying the
complexity of the problem of computing a mixed Nash equilibrium in a game, we provide …

Logical dynamic games (LDGs) are a class of dynamic games that incorporate logical
dynamics to describe the evolution of external states. Such games can be found in a wide …

We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is
complete for the complexity class PPAD (Polynomial Parity Argument, Directed version) …

We investigate from the computational viewpoint multi-player games that are guaranteed to
have pure Nash equilibria. We focus on congestion games, and show that a pure Nash …

In multiagent systems, strategic settings are often analyzed under the assumption that the
players choose their strategies simultaneously. However, this model is not always realistic …

The status of the P versus NP problem Page 1 78 commuNicaTioNS of The acm |
SePteMber 2009 | voL. 52 | No. 9 review articles Doi:10.1145/1562164.1562186 It’s one of …