Home

players

Video games and the perception of very long durations by adolescents

Jason Rutter - Tue, 26/01/2010 - 16:42
Keywords:

New entry in Digiplay games research bibliography:

In the present study, we tested the hypothesis that adolescents might underestimate time while playing a video game. To test this hypothesis, 116 adolescents (14-15 years old) had to judge prospectively or retrospectively the duration of three consecutive tasks: a 8 min and a 24 min task of playing video game (Tetris) and an 8 min task of reading on a computer screen (control task). The main hypothesis received support: for a same duration, the video game task was estimated as shorter than the reading task. Moreover, participants with a game-inclined profile showed a stronger underestimation of time while playing. Finally, the short durations were overestimated and the long duration underestimated. The main findings are accounted for by an attention-based explanation.

Ludic Reality: a construct for analysing epistemology and meaning-mapping in play

danpinchbeck - Tue, 22/05/2007 - 08:19
Keywords:

New entry in Digiplay games research bibliography:

First Person Games induce presence, thus fulfilling Steuer’s definition as virtual realities. As such, it is worth considering the qualities of the realities they form and how these may help us understand the relationship between the player, the contents of the game and the game system itself. Ludic reality is proposed as a construct to elucidate this relationship: an artificial temporal space in which the constrained rules of the system, the semantic contents and sequencing constructs it contains, and the behaviour and subjective experience of the player are combined into a more-or-less stable and effective state of being-in-theworld. Ludic reality directly addresses the question of the impact of internal, semantic factors in the experience, such as world, narrative and agency, together with the adoption, by the player, of a schematic, structured means of effectively interacting with the system to draw out its specific systems of affordances and reward.

Computer game playing in early adolescence

Jason Rutter - Fri, 09/03/2007 - 21:04
Keywords:

New entry in Digiplay games research bibliography:

Home computer game playing appears to be one of the social and leisure phenomena of the nineties, yet there is still little known about the acquisition, development, and maintenance of computer game playing among children and adolescents. A survey of 147 eleven-year-old computer game players attending a summer camp revealed that their main reasons for playing were for fun, for a challenge, because there was nothing else to do, and because their friends did. Males played computer games significantly more regularly than did females and were significantly more likely to play sports simulation games and violent games. Females were found to play platform games and puzzlers significantly more than did males. It is suggested that computer game playing for most children is a fairly absorbing and harmless activity but that, for a small minority of children, it may be problematic.

Searching for an agent who may or may not want to be found

Jason Rutter - Thu, 22/02/2007 - 13:59
Keywords:

New entry in Digiplay games research bibliography:

There is an extensive theory regarding optimal continuous path search for a mobile or immobile 'target.' The traditional theory assumes that the target is one of three types: (i) an object with a known distribution of paths, (ii) a mobile or immobile hider who wants to avoid or delay capture, or (iii) a rendezvouser who wants to find the searcher. This paper introduces a new type of search problem by assuming that aims of the target are not known to the searcher. The target may be either a type (iii) cooperator (with a known cooperation probability c) or a type (ii) evader. This formulation models search problems like that for a lost teenager who may be a 'runaway,' or a lost intelligence agent who may be a defector. In any given search context, it produces a continuum of search problems F(c), 0 less than or equal to c less than or equal to 1, linking a zero-sum search game (with c = 0) to a rendezvous problem (with c = 1). These models thus provide a theoretical bridge between two previously distinct parts of search theory, namely search games and rendezvous search.

Syndicate content