Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Entire DC Network

A Desire Fulfillment Theory Of Digital Game Enjoyment, Owen M. Schaffer Dec 2019

A Desire Fulfillment Theory Of Digital Game Enjoyment, Owen M. Schaffer

College of Computing and Digital Media Dissertations

Empirical research on what makes digital games enjoyable is critical for practitioners who want to design for enjoyment, including for Game Design, Gamification, and Serious Games. But existing theories of what leads to digital game enjoyment have been incomplete or lacking in empirical support showing their impact on enjoyment.

Desire Fulfillment Theory is proposed as a new theory of what leads to digital game enjoyment and tested through research with people who have recently played a digital game. This theory builds on three established theories: Expectancy Disconfirmation Theory, Theory of Basic Human Desires, and Flow Theory. These three theories are ...


The Effects Of Diagrams And Relational Complexity On User Performance In Conditional Probability Problems In A Non-Learning Context, Vincent J. Kellen Jun 2012

The Effects Of Diagrams And Relational Complexity On User Performance In Conditional Probability Problems In A Non-Learning Context, Vincent J. Kellen

College of Computing and Digital Media Dissertations

Many disciplines in everyday life depend on improved performance in conditional probability problems. Most adults struggle with conditional probability problems and several prior studies have shown participant accuracy is less than 50%. This study examined user performance when aided with computer-generated Venn and Euler type diagrams in a non-learning context. Despite the prevalence of research into diagrams and extensive research into conditional probability problem solving, this study is one of the only studies to apply theories of working memory to predict user performance in conditional probability problems with diagrams. Following relational complexity theory, this study manipulated problem complexity in computer ...