Using Reasoning Patterns to Simplify Games

Abstract

In complex strategic situations decision-making agents interact with many other agents and have access to many pieces of information throughout their play. This usu-ally leads to game solving being a very complex, almost intractable procedure. Moreover, algorithms for solving games usually fail to explain how the various equilibria come about and how “plausible ” they are. Reasoning patterns try to capture the strategic thinking of agents and formalize the usage of the various information or evidence they obtain during their interactions. Identify-ing reasoning patterns can lead to a significant refine-ment over the full range of equilibria, as well as con-siderable computational savings in solving the game. Here we present a polynomial-time algorithm that sim-

Cite

Text

Antos and Pfeffer. "Using Reasoning Patterns to Simplify Games." AAAI Conference on Artificial Intelligence, 2008.

Markdown

[Antos and Pfeffer. "Using Reasoning Patterns to Simplify Games." AAAI Conference on Artificial Intelligence, 2008.](https://mlanthology.org/aaai/2008/antos2008aaai-using/)

BibTeX

@inproceedings{antos2008aaai-using,
  title     = {{Using Reasoning Patterns to Simplify Games}},
  author    = {Antos, Dimitrios and Pfeffer, Avi},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2008},
  pages     = {1770-1771},
  url       = {https://mlanthology.org/aaai/2008/antos2008aaai-using/}
}