An overview of multi-agent reinforcement learning from game theoretical perspective
Y Yang, J Wang - ar** market
This paper develops three game-theoretical models to analyze ship** competition
between two carriers in a new emerging liner container ship** market. The behavior of …
between two carriers in a new emerging liner container ship** market. The behavior of …
How hard is it to approximate the best Nash equilibrium?
The quest for a polynomial-time approximation scheme (PTAS) for Nash equilibrium in a two-
player game, which emerged as a major open question in algorithmic game theory, seeks to …
player game, which emerged as a major open question in algorithmic game theory, seeks to …
On the complexity of approximating a Nash equilibrium
C Daskalakis - ACM Transactions on Algorithms (TALG), 2013 - dl.acm.org
We show that computing a relatively (ie, multiplicatively as opposed to additively)
approximate Nash equilibrium in two-player games is PPAD-complete, even for constant …
approximate Nash equilibrium in two-player games is PPAD-complete, even for constant …
Approximating nash equilibria and dense bipartite subgraphs via an approximate version of caratheodory's theorem
S Barman - Proceedings of the forty-seventh annual ACM …, 2015 - dl.acm.org
We present algorithmic applications of an approximate version of Caratheodory's theorem.
The theorem states that given a set of vectors X in Rd, for every vector in the convex hull of X …
The theorem states that given a set of vectors X in Rd, for every vector in the convex hull of X …