Corpus ID: 225075680

Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information

@article{Ganzfried2020ComputingNE,
  title={Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information},
  author={Sam Ganzfried},
  journal={ArXiv},
  year={2020},
  volume={abs/2010.13860}
}
  • Sam Ganzfried
  • Published 2020
  • Computer Science
  • ArXiv
  • Many important real-world settings contain multiple players interacting over an unknown duration with probabilistic state transitions, and are naturally modeled as stochastic games. Prior research on algorithms for stochastic games has focused on two-player zero-sum games, games with perfect information, and games with imperfect-information that is local and does not extend between game states. We present an algorithm for approximating Nash equilibrium in multiplayer general-sum stochastic… CONTINUE READING

    Tables from this paper

    References

    SHOWING 1-10 OF 16 REFERENCES
    Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information
    • 43
    • Highly Influential
    • PDF
    Computing Stackelberg Equilibria in Discounted Stochastic Games
    • 32
    • PDF
    Settling the Complexity of Two-Player Nash Equilibrium
    • X. Chen, X. Deng
    • Mathematics, Computer Science
    • 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
    • 2006
    • 575
    • PDF
    Computing the optimal strategy to commit to
    • 415
    • PDF
    Computing an approximate jam/fold equilibrium for 3-player no-limit Texas Hold'em tournaments
    • 41
    • PDF
    The complexity of computing a Nash equilibrium
    • 674
    • PDF
    Computing Solutions in Infinite-Horizon Discounted Adversarial Patrolling Games
    • 46
    • PDF
    Fictitious Play Outperforms Counterfactual Regret Minimization
    • 4
    • PDF
    The Complexity of Markov Decision Processes
    • 1,243
    • PDF