Identifying reasoning patterns in games

Dimitrios Antos, Avi Pfeffer
Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, PMLR R6:9-18, 2008.

Abstract

We present an algorithm that identifies the reasoning patterns of agents in a game, by iteratively examining the graph structure of its Multi-Agent Influence Diagram (MAID) representation. If the decision of an agent participates in no reasoning patterns, then we can effectively ignore that decision for the purpose of calculating a Nash equilibrium for the game. In some cases, this can lead to exponential time savings in the process of equilibrium calculation. Moreover, our algorithm can be used to enumerate the reasoning patterns in a game, which can be useful for constructing more effective computerized agents interacting with humans.

Cite this Paper

BibTeX
@InProceedings{pmlr-vR6-antos08a, title = {Identifying reasoning patterns in games}, author = {Antos, Dimitrios and Pfeffer, Avi}, booktitle = {Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence}, pages = {9--18}, year = {2008}, editor = {McAllester, David A. and Myllymäki, Petri}, volume = {R6}, series = {Proceedings of Machine Learning Research}, month = {09--12 Jul}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/r6/main/assets/antos08a/antos08a.pdf}, url = {https://proceedings.mlr.press/r6/antos08a.html}, abstract = {We present an algorithm that identifies the reasoning patterns of agents in a game, by iteratively examining the graph structure of its Multi-Agent Influence Diagram (MAID) representation. If the decision of an agent participates in no reasoning patterns, then we can effectively ignore that decision for the purpose of calculating a Nash equilibrium for the game. In some cases, this can lead to exponential time savings in the process of equilibrium calculation. Moreover, our algorithm can be used to enumerate the reasoning patterns in a game, which can be useful for constructing more effective computerized agents interacting with humans.}, note = {Reissued by PMLR on 09 October 2024.} }
Endnote
%0 Conference Paper %T Identifying reasoning patterns in games %A Dimitrios Antos %A Avi Pfeffer %B Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence %C Proceedings of Machine Learning Research %D 2008 %E David A. McAllester %E Petri Myllymäki %F pmlr-vR6-antos08a %I PMLR %P 9--18 %U https://proceedings.mlr.press/r6/antos08a.html %V R6 %X We present an algorithm that identifies the reasoning patterns of agents in a game, by iteratively examining the graph structure of its Multi-Agent Influence Diagram (MAID) representation. If the decision of an agent participates in no reasoning patterns, then we can effectively ignore that decision for the purpose of calculating a Nash equilibrium for the game. In some cases, this can lead to exponential time savings in the process of equilibrium calculation. Moreover, our algorithm can be used to enumerate the reasoning patterns in a game, which can be useful for constructing more effective computerized agents interacting with humans. %Z Reissued by PMLR on 09 October 2024.
APA
Antos, D. & Pfeffer, A.. (2008). Identifying reasoning patterns in games. Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, in Proceedings of Machine Learning Research R6:9-18 Available from https://proceedings.mlr.press/r6/antos08a.html. Reissued by PMLR on 09 October 2024.

Related Material