title: Optimally designing games for behavioural research.
abstract: Computer games can be motivating and engaging experiences that facilitate learning, leading to their increasing use in education and behavioural experiments. For these applications, it is often important to make inferences about the knowledge and cognitive processes of players based on their behaviour. However, designing games that provide useful behavioural data are a difficult task that typically requires significant trial and error. We address this issue by creating a new formal framework that extends optimal experiment design, used in statistics, to apply to game design. In this framework, we use Markov decision processes to model players' actions within a game, and then make inferences about the parameters of a cognitive model from these actions. Using a variety of concept learning games, we show that in practice, this method can predict which games will result in better estimates of the parameters of interest. The best games require only half as many players to attain the same level of precision.
authors.affiliation: Computer Science Division , University of California , Berkeley, CA 94720, USA.
authors.forename: Anna N
authors.initials: AN
authors.lastname: Rafferty
authors.affiliation: Computer Science Division , University of California , Berkeley, CA 94720, USA.
authors.forename: Matei
authors.initials: M
authors.lastname: Zaharia
authors.affiliation: Department of Psychology , University of California , Berkeley, CA 94720, USA.
authors.forename: Thomas L
authors.initials: TL
authors.lastname: Griffiths
keywords: Markov decision process; cognitive science; computer games; optimal experiment design