"The Collecting Itself Feels Good": Towards Collection Interfaces for Digital Game Objects

© Lennart Nacke, 2016. This is the author’s version of the work. It is posted here for your personal use. Not for redistribution. The definitive version was published in CHI PLAY Companion '16 Proceedings of the 2016 Annual Symposium on Computer-Human Interaction in Play Companion Extended Abstracts, https://doi.org/10.1145/2967934.2968088Digital games offer a variety of collectible objects. We investigate players' collecting behaviors in digital games to determine what digital game objects players enjoyed collecting and why they valued these objects. Using this information, we seek to inform the design of future digital game object collection interfaces. We discuss the types of objects that players prefer, the reasons that players value digital game objects, and how collection behaviors may guide play. Through our findings, we identify design implications for digital game object collection interfaces: enable object curation, preserve rules and mechanics, preserve context of play, and allow players to share their collections with others. Digital game object collection interfaces are applicable to the design of digital games, gamified applications, and educational software.Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada Social Sciences and Humanities Research Council of CanadaPeer-reviewe

Secure referee selection for fair and responsive peer-to-peer gaming

Peer-to-Peer (P2P) architectures for Massively Multiplayer Online Games (MMOG) provide better scalability than Client/Server (C/S); however, they increase the possibility of cheating. Recently proposed P2P protocols use trusted referees that simulate/validate the game to provide security equivalent to C/S. When selecting referees from untrusted peers, selecting non-colluding referees becomes critical. Further, referees should be selected such that the range and length of delays to players is minimised (maximising game fairness and responsiveness). In this paper we formally define the referee selection problem and propose two secure referee selection algorithms, SRS-1 and SRS-2, to solve it. Both algorithms ensure the probability of corrupt referees controlling a zone/region is below a predefined limit, while attempting to maximise responsiveness and fairness. The trade-off between responsiveness and fairness is adjustable for both algorithms. Simulations of three different scenarios show the effectiveness of our algorithms

Validity Threats in Quantitative Data Collection with Games : A Narrative Survey

Background. Games are increasingly used to collect scientific data. Some suggest that game features like high cognitive load may limit the inferences we can draw from such data, yet no systematic overview exists of potential validity threats of game-based methods. Aim. We present a narrative survey of documented and potential threats to validity in using games for quantitative data collection. Method. We combined an unsystematic bottom-up literature review with a systematic top-down application of standard validity threat typologies to games to arrive at a systematisation of game-characteristic validity threats. Results. We identify three game characteristics that potentially impact validity: Games are complex systems, impeding the predictable control and isolation of treatments. They are rich in unwanted variance and diversity. And their social framing can differ from and interact with the framing of research studies or non-game situations they are supposed to represent. The diversity of gamers and their differences to general populations bring further complications. Discussion and Conclusions. The wealth of potential validity threats in game-based research is met by a dearth of systematic methodological studies, leading us to outline several future research directions