Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
game complexity
Description:
A property of games describing the difficulty or extent of their rules, possible states, and strategic choices, studied in game theory and design.
Related topics:
Artificial Intelligence in Games (17%),
Game Theory and Applications (12%),
Educational Games and Gamification (11%),
Complexity and Algorithms in Graphs (9%),
Advanced Graph Theory Research (9%),
Digital Games and Media (8%)
show all 6
Wikidata ID:
wiki/Q903738
OpenAlex ID:
keywords/game-complexity
On the Complexity of Cooperative Solution Concepts
1994
·
Xiaotie Deng
, Christos H. Papadimitriou
·
Mathematics of Operations Research
·
772
Multi-agent influence diagrams for representing and solving games
2003
·
Daphne Koller
, Brian Milch
·
Games and Economic Behavior
·
458
Trends of tactical performance analysis in team sports: bridging the gap between research, training and competition
2009
·
Júlio Garganta
·
Revista Portuguesa de Ciências do Desporto
·
376
PDF
Current Practices in Serious Game Research: A Review from a Learning Outcomes Perspective
2009
·
Pieter Wouters
, Erik D. van der Spek
, et al.
·
IGI Global eBooks
·
308
Flow experiences of children in an interactive social game environment
2007
·
Yavuz Inal
, Kursat Cagiltay
·
British Journal of Educational Technology
·
292
Experiences of Time Loss among Videogame Players: An Empirical Study
2007
·
Richard T.A. Wood
, Mark D. Griffiths
, et al.
·
CyberPsychology & Behavior
·
289
Deciding parity games in quasipolynomial time
2017
·
Cristian S. Calude
, Sanjay Jain
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
259
The impact of tutorials on games of varying complexity
2012
·
Erik Andersen
, Eleanor O'Rourke
, et al.
·
CHI Conference on Human Factors in Computing Systems
·
227
Computing Nash Equilibria: Approximation and Smoothed Complexity
2006
·
Xi Chen
, Xiaotie Deng
, et al.
·
Annual Symposium on Foundations of Computer Science
·
213
PDF
Games, Puzzles, and Computation
2009
·
Robert A. Hearn
, Erik D. Demaine
·
A K Peters/CRC Press eBooks
·
209
GO Is Polynomial-Space Hard
1980
·
David Lichtenstein
, Michael Sipser
·
Journal of the ACM
·
206
PDF
Four results on randomized incremental constructions
1992
·
Kenneth L. Clarkson
, Kurt Mehlhorn
, et al.
·
Lecture notes in computer science
·
182
PDF
The Complexity of Go.
1983
·
J. M. Robson
·
IFIP Congress
·
165
Improving ‘at-action’ decision-making in team sports through a holistic coaching approach
2012
·
Richard L. Light
, Stephen Harvey
, et al.
·
Sport Education and Society
·
160
Rush Hour is PSPACE-complete, or “Why you should generously tip parking lot attendants”
2002
·
Gary William Flake
, Eric B. Baum
·
Theoretical Computer Science
·
137
PDF
Games, puzzles, and computation
2010
·
Choice Reviews Online
·
130
The Tobin q as a company performance indicator
2003
·
Joe Wolfe
, Antônio Carlos Aidar Sauaia
·
Developments in Business Simulation and Experiential Learning
·
128
Satisfação e aprendizagem em jogos de empresas: contribuições para a educação gerencial
1995
·
Antonio Carlos Aidar Sauaia
·
Digital Library of Theses and Dissertations (Universidade de São Paulo)
·
128
PDF
On Minmax Theorems for Multiplayer Games
2011
·
Yang Cai
, Constantinos Daskalakis
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
127
Game Design for Older Adults: Effects of Age-Related Changes on Structural Elements of Digital Games
2012
·
Kathrin Maria Gerling
, Frank Paul Schulte
, et al.
·
Lecture notes in computer science
·
118
A Short‐term Longitudinal Study of Children's Playground Games in Primary School: Implications for Adjustment to School and Social Adjustment in the USA and the UK
2004
·
Anthony D. Pellegrini
, Peter Blatchford
, et al.
·
Social Development
·
117
Generalized Parity Games
2007
·
Krishnendu Chatterjee
, Thomas A. Henzinger
, et al.
·
Springer eBooks
·
104
PDF
Classic Nintendo games are (computationally) hard
2015
·
Greg Aloupis
, Erik D. Demaine
, et al.
·
Theoretical Computer Science
·
100
On oblivious PTAS's for nash equilibrium
2009
·
Constantinos Daskalakis
, Christos H. Papadimitriou
·
ACM Symposium on Theory of Computing (STOC)
·
98
Inapproximability of Nash Equilibrium
2018
·
Aviad Rubinstein
·
SIAM Journal on Computing
·
93
PDF
Show more works
View as search
Works count:
816
Citation count:
11,040
Year
Topic
Type