Tree polymatrix games are ppad-hard
We prove that it is PPAD-hard to compute a Nash equilibrium in a tree polymatrix game with
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
[PDF][PDF] Tree Polymatrix Games are PPAD-hard
A Deligkas, J Fearnley, R Savani - core.ac.uk
A polymatrix game is a succinctly represented many-player game. The players are
represented 24 by vertices in an interaction graph, where each edge of the graph specifies a …
represented 24 by vertices in an interaction graph, where each edge of the graph specifies a …
[PDF][PDF] Tree Polymatrix Games Are PPAD-Hard
A Deligkas, J Fearnley, R Savani - scholar.archive.org
We prove that it is PPAD-hard to compute a Nash equilibrium in a tree polymatrix game with
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
Tree Polymatrix Games Are PPAD-Hard
A Deligkas, J Fearnley, R Savani - 47th International Colloquium …, 2020 - drops.dagstuhl.de
We prove that it is PPAD-hard to compute a Nash equilibrium in a tree polymatrix game with
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
[PDF][PDF] Tree Polymatrix Games Are PPAD-Hard
A Deligkas, J Fearnley, R Savani - dagstuhl.sunsite.rwth-aachen.de
We prove that it is PPAD-hard to compute a Nash equilibrium in a tree polymatrix game with
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
[PDF][PDF] Tree Polymatrix Games Are PPAD-Hard
A Deligkas, J Fearnley, R Savani - cs.emis.de
We prove that it is PPAD-hard to compute a Nash equilibrium in a tree polymatrix game with
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
Tree Polymatrix Games are PPAD-hard
A Deligkas, J Fearnley, R Savani - arXiv e-prints, 2020 - ui.adsabs.harvard.edu
We prove that it is PPAD-hard to compute a Nash equilibrium in a tree polymatrix game with
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
Tree Polymatrix Games Are PPAD-Hard}}
A Deligkas, J Fearnley, R Savani - 47th International Colloquium on …, 2020 - cs.emis.de
We prove that it is PPAD-hard to compute a Nash equilibrium in a tree polymatrix game with
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
Tree Polymatrix Games Are PPAD-Hard
A Deligkas, J Fearnley, R Savani - 47th International Colloquium …, 2020 - drops.dagstuhl.de
We prove that it is PPAD-hard to compute a Nash equilibrium in a tree polymatrix game with
twenty actions per player. This is the first PPAD hardness result for a game with a constant …
twenty actions per player. This is the first PPAD hardness result for a game with a constant …