Tractable algorithms for approximate Nash equilibria in generalized graphical games with tree structure

L Ortiz, M Irfan - Proceedings of the AAAI Conference on Artificial …, 2017 - ojs.aaai.org
We provide the first fully polynomial time approximation scheme (FPTAS) for computing an
approximate mixed-strategy Nash equilibrium in graphical multi-hypermatrix games …
被引用次数：19 相关文章
[PDF] bowdoin.edu

[PDF][PDF] Tractable Algorithms for Approximate Nash Equilibria in Generalized Graphical Games with Tree Structure

LE Ortiz, MT Irfan - 2017 - tildesites.bowdoin.edu
We provide the first fully polynomial time approximation scheme (FPTAS) for computing an
approximate mixedstrategy Nash equilibrium in graphical multi-hypermatrix games …
[PDF] aaai.org

[PDF][PDF] Tractable Algorithms for Approximate Nash Equilibria in Generalized Graphical Games with Tree Structure

LE Ortiz, MT Irfan - 2017 - cdn.aaai.org
We provide the first fully polynomial time approximation scheme (FPTAS) for computing an
approximate mixedstrategy Nash equilibrium in graphical multi-hypermatrix games …

Tractable algorithms for approximate nash equilibria in generalized graphical games with tree structure

LE Ortiz, MT Irfan - Proceedings of the Thirty-First AAAI Conference on …, 2017 - dl.acm.org
We provide the first fully polynomial time approximation scheme (FPTAS) for computing an
approximate mixed-strategy Nash equilibrium in graphical multi-hypermatrix games …
[PDF] archive.org

[PDF][PDF] Tractable Algorithms for Approximate Nash Equilibria in Generalized Graphical Games with Tree Structure

LE Ortiz, MT Irfan - 2017 - scholar.archive.org
We provide the first fully polynomial time approximation scheme (FPTAS) for computing an
approximate mixedstrategy Nash equilibrium in graphical multi-hypermatrix games …