On the Complexity of General Game Playing
The Game Description Language (GDL) used in General Game Playing (GGP) competitions provides a compact way to express multi-agents systems. Multiple features of GDL contribute to making it a convenient tool to describe multi-agent systems. We study the computational complexity of reasoning in GGP using various combinations of these features. Our analysis offers a complexity landscape for GGP with fragments ranging from np to expspace in the single-agent case, and from pspace to 2exptime in the multi-agent case.
Unable to display preview. Download preview PDF.
- 4.Genesereth, M., Love, N.: General Game Playing: Overview of the AAAI competition. AI Magazine 26, 62–72 (2005)Google Scholar
- 6.Love, N.C., Hinrichs, T.L., Genesereth, M.R.: General Game Playing: Game Description Language specification. Tech. rep., LG-2006-01, Stanford Logic Group (2006)Google Scholar
- 9.Rintanen, J.: Complexity of planning with partial observability. In: 14th International Conference on Automated Planning and Scheduling (ICAPS), pp. 345–354. AAAI Press (2004)Google Scholar
- 13.Thielscher, M.: A general Game Description Language for incomplete information games. In: 24th AAAI Conference on Artificial Intelligence (AAAI), pp. 994–999. AAAI Press, Atlanta (2010)Google Scholar
- 14.Thielscher, M.: The general Game playing Description Language is universal. In: 22nd International Joint Conference on Artificial Intelligence, pp. 1107–1112. IJCAI (2011)Google Scholar