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

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed