Simple Priced Timed Games Are Not That Simple

Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modeling the costs of spending time in a state and executing an action, respectively). The goals of the players are to minimise and maximise the cost to reach a target location, respectively. We consider priced timed games with one clock and arbitrary (positive and negative) weights and show that, for an important subclass of theirs (the so-called simple priced timed games), one can compute, in exponential time, the optimal values that the players can achieve, with their associated optimal strategies. As side results, we also show that one-clock priced timed games are determined and that we can use our result on simple priced timed games to solve the more general class of so-called reset-acyclic priced timed games (with arbitrary weights and one-clock)

Tabletop prototyping of serious games for ‘soft skills’ training

Serious games offer a relatively low cost, highly engaging alternative to traditional forms of soft skills training. The current paper describes an approach taken to designing a serious game for the training of soft skills. A tabletop prototype of the game was created and evaluated with a group of 24 participants. Initial findings suggest that the game successfully created an environment in which it was advantageous to engage in appropriate collaborative decision making behaviors, as well as providing built-in opportunities for a tutor to guide under-performing groups

Timed Parity Games: Complexity and Robustness

We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are \emph{concurrent} in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to \emph{turn-based} (i.e., not concurrent) \emph{finite-state} (i.e., untimed) parity games. Our reduction improves the best known complexity for solving timed parity games. Moreover, the rich class of algorithms for classical parity games can now be applied to timed parity games. The states of the resulting game are based on clock regions of the original game, and the state space of the finite game is linear in the size of the region graph. Second, we consider two restricted classes of strategies for the player that represents the controller in a real-time synthesis problem, namely, \emph{limit-robust} and \emph{bounded-robust} winning strategies. Using a limit-robust winning strategy, the controller cannot choose an exact real-valued time delay but must allow for some nonzero jitter in each of its actions. If there is a given lower bound on the jitter, then the strategy is bounded-robust winning. We show that exact strategies are more powerful than limit-robust strategies, which are more powerful than bounded-robust winning strategies for any bound. For both kinds of robust strategies, we present efficient reductions to standard timed automaton games. These reductions provide algorithms for the synthesis of robust real-time controllers

Thereʼs no ʻIʼ in ʻEmergency Management Team:ʼ designing and evaluating a serious game for training emergency managers in group decision making skills

Serious games are games that are designed to educate rather than entertain. The game outlined and evaluated here was commissioned and designed as a tool to improve the group decision making skills of people who manage real-world emergencies such as floods, fires, volcanoes and chemical spills. The game design exploits research on decision making groups and applies pedagogically sound games design principles. An evaluation of the game design was carried out based on a paper prototype. Eight participants were recruited and assigned to two groups of four participants each. These groups were video recorded while playing the game and the video was analysed in terms of game actions and member participation. Results indicate that the group who behaved in a more appropriate manner for a decision making group were rewarded with more positive feedback from the game state. These findings suggest that the game itself delivers appropriate feedback to players on their collaborative behaviour and is thus fit for the purposes intended in the current project

Activity-promoting gaming systems in exercise and rehabilitation

Commercial activity-promoting gaming systems provide a potentially attractive means to facilitate exercise and rehabilitation. The Nintendo Wii, Sony EyeToy, Dance Dance Revolution, and Xbox Kinect are examples of gaming systems that use the movement of the player to control gameplay. Activity-promoting gaming systems can be used as a tool to increase activity levels in otherwise sedentary gamers and also be an effective tool to aid rehabilitation in clinical settings. Therefore, the aim of this current work is to review the growing area of activity-promoting gaming in the context of exercise, injury, and rehabilitation

Model Checking the Quantitative mu-Calculus on Linear Hybrid Systems

We study the model-checking problem for a quantitative extension of the modal mu-calculus on a class of hybrid systems. Qualitative model checking has been proved decidable and implemented for several classes of systems, but this is not the case for quantitative questions that arise naturally in this context. Recently, quantitative formalisms that subsume classical temporal logics and allow the measurement of interesting quantitative phenomena were introduced. We show how a powerful quantitative logic, the quantitative mu-calculus, can be model checked with arbitrary precision on initialised linear hybrid systems. To this end, we develop new techniques for the discretisation of continuous state spaces based on a special class of strategies in model-checking games and present a reduction to a class of counter parity games.Comment: LMCS submissio

The precision of experienced action video-game players: Line bisection reveals reduced leftward response bias

Twenty-two experienced action video-game players (AVGPs) and 18 non-VGPs were tested on a pen-and-paper line bisection task that was untimed. Typically, right-handers bisect lines 2 % to the left of true centre, a bias thought to reflect the dominance of the right-hemisphere for visuospatial attention. Expertise may affect this bias, with expert musicians showing no bias in line bisection performance. Our results show that experienced-AVGPs also bisect lines with no bias with their right hand and a significantly reduced bias with their left hand compared to non-AVGPs. Bisections by experienced-AVGPs were also more precise than those of non-AVGPs. These findings show the cognitive proficiencies of experienced-AVGPs can generalize beyond computer based tasks, which resemble their training environment