Algorithms for Finding Approximate Formations in Games

@inproceedings{Jordan2010AlgorithmsFF,
  title={Algorithms for Finding Approximate Formations in Games},
  author={Patrick R. Jordan and Michael P. Wellman},
  booktitle={AAAI},
  year={2010}
}
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted subsets of the entire strategy space. We develop algorithms to identify rationally closed subsets of the strategy space under given size constraints. First, we modify an existing family of algorithms for rational closure in two-player games to compute a related rational closure concept, called formations, for n-player… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

LeytonBrown. Run the GAMUT: A comprehensive approach to evaluating game-theoretic algorithms

E. Nudelman, J. Wortman, Y. Shoham
  • In Third International Joint Conference on Autonomous Agents and Multiagent Systems,
  • 2004
VIEW 3 EXCERPTS

Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms

  • Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004.
  • 2004