Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “GAMES”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

Helping Video Games Rewire "Our Minds"

Biofeedback-modulated video games are games that respond to physiological signals as well as mouse, joystick or game controller input; they embody the concept of improving physiological functioning by rewarding specific healthy body signals with success at playing a video game. The NASA patented biofeedback-modulated game method blends biofeedback into popular off-the- shelf video games in such a way that the games do not lose their entertainment value. This method uses physiological signals (e.g., electroencephalogram frequency band ratio) not simply to drive a biofeedback display directly, or periodically modify a task as in other systems, but to continuously modulate parameters (e.g., game character speed and mobility) of a game task in real time while the game task is being performed by other means (e.g., a game controller). Biofeedback-modulated video games represent a new generation of computer and video game environments that train valuable mental skills beyond eye-hand coordination. These psychophysiological training technologies are poised to exploit the revolution in interactive multimedia home entertainment for the personal improvement, not just the diversion, of the user.

Pope, Alan T.↗

HackAttack: Game-Theoretic Analysis of Realistic Cyber Conflicts

Game theory is appropriate for studying cyber conflict because it allows for an intelligent and goal-driven adversary. Applications of game theory have led to a number of results regarding optimal attack and defense strategies. However, the overwhelming majority of applications explore overly simplistic games, often ones in which each participant s actions are visible to every other participant. These simplifications strip away the fundamental properties of real cyber conflicts: probabilistic alerting, hidden actions, unknown opponent capabilities. In this paper, we demonstrate that it is possible to analyze a more realistic game, one in which different resources have different weaknesses, players have different exploits, and moves occur in secrecy, but they can be detected. Certainly, more advanced and complex games are possible, but the game presented here is more realistic than any other game we know of in the scientific literature. While optimal strategies can be found for simpler games using calculus, case-by-case analysis, or, for stochastic games, Q-learning, our more complex game is more naturally analyzed using the same methods used to study other complex games, such as checkers and chess. We define a simple evaluation function and employ multi-step searches to create strategies. We show that such scenarios can be analyzed, and find that in cases of extreme uncertainty, it is often better to ignore one s opponent s possible moves. Furthermore, we show that a simple evaluation function in a complex game can lead to interesting and nuanced strategies.

botnets↗

Serious Games that Improve Performance

Serious games can help people function more effectively in complex settings, facilitate their role as team members, and provide insight into their team's mission. In such games, coordination and cooperation among team members are foundational to the mission's success and provide a preview of what individuals and the team as a whole could choose to do in a real scenario. Serious games often model events requiring life-or-death choices, such as civilian rescue during chemical warfare. How the players communicate and what actions they take can determine the number of lives lost or saved. However, merely playing a game is not enough to realize its most practical value, which is in learning what actions and communication methods are closest to what the mission requires. Teams often play serious games in isolation, so when the game is complete, an analytical stage is needed to extract the strategies used and examine each strategy's success relative to the others chosen. Recognizing the importance of this next stage, Noblis has been developing Game Analysis, software that parses individual game play into meaningful units and generates a strategic analysis. Trainers create a custom game-specific grammar that reflects the objects and range of actions allowable in a particular game, which Game Analysis then uses to parse the data and generate a practical analysis. Trainers have then enough information to represent strategies in tools, such as Gantt and heat map charts. First-responder trainees in North Carolina have already partnered Hot-Zone and Game Analysis with great success.

McGowan, Clement, III↗

Beyond game effectiveness. Part II, a qualitative study of multi-role experiential learning

The present paper is the second in a series published at I/ITSEC that seeks to explain the efficacy of multi-role experiential learning employed to create engaging game-based training methods transitioned to the U.S. Army, U.S. Army Special Forces, Civil Affairs, and Psychological Operations teams. The first publication (I/ITSEC 2009) summarized findings from a quantitative study that investigated experiential learning in the multi-player, PC-based game module transitioned to PEO-STRI, DARWARS Ambush! NK (non-kinetic). The 2009 publication reported that participants of multi-role (Player and Reflective Observer/Evaluator) game-based training reported statistically significant learning and engagement. Additionally when the means of the two groups (Player and Reflective Observer/Evaluator) were compared, they were not statistically significantly different from each other. That is to say that both playing as well as observing/evaluating were engaging learning modalities. The Observer/Evaluator role was designed to provide an opportunity for real-time reflection and meta-cognitive learning during game play. Results indicated that this role was an engaging way to learn about communication, that participants learned something about cultural awareness, and that the skills they learned were helpful in problem solving and decision-making. The present paper seeks to continue to understand what and how users of non-kinetic game-based missions learn by revisiting the 2009 quantitative study with further investigation such as stochastic player performance analysis using latent semantic analyses and graph visualizations. The results are applicable to First-Person game-based learning systems designed to enhance trainee intercultural communication, interpersonal skills, and adaptive thinking. In the full paper, we discuss results obtained from data collected from 78 research participants of diverse backgrounds who trained by engaging in tasks directly, as well as observing and evaluating peer performance in real-time. The goal is two-fold. One is to quantify and visualize detailed player performance data coming from game play transcription to give further understanding to the results in the 2009 I/ITSEC paper. The second is to develop a set of technologies from this quantification and visualization approach into a generalized application tool to be used to aid in future games’ development of player/learner models and game adaptation algorithms. Specifically, this paper addresses questions such as, “Are there significant differences in one's experience when an experiential learning task is observed first, and then performed by the same individual?” “Are there significant differences among groups participating in different roles in non-kinetic engagement training, especially when one role requires more active participation that the other?” “What is the impact of behavior modeling on learning in games?” In answering these questions the present paper reinforces the 2009 empirical study conclusion that contrary to current trends in military game development, experiential learning is enhanced by innovative training approaches designed to facilitate trainee mastery of reflective observation and abstract conceptualization as much as performance-based skills.

59 BASIC BIOLOGICAL SCIENCES↗

Simulation games that integrate research, entertainment, and learning around ecosystem services

Humans currently spend over 3 billion person-hours per week playing computer games. Most of these games are purely for entertainment, but use of computer games for education has also expanded dramatically. At the same time, experimental games have become a staple of social science research but have depended on relatively small sample sizes and simple, abstract situations, limiting their range and applicability. If only a fraction of the time spent playing computer games could be harnessed for research, it would open up a huge range of new opportunities. We review the use of games in research, education, and entertainment and develop ideas for integrating these three functions around the idea of ecosystem services valuation. This approach to valuation can be seen as a version of choice modeling that allows players to generate their own scenarios taking account of the trade-offs embedded in the game, rather than simply ranking pre-formed scenarios. We outline a prototype game called Lagom Island to test the proposition that gaming can be used to reveal the value of ecosystem services. Ultimately, our prototype provides a potential pathway and functional building blocks for approaching the relatively untapped potential of games in the context of ecosystem services research.

97 MATHEMATICS AND COMPUTING↗

Cognitive Model of Trust Dynamics Predicts Human Behavior within and between Two Games of Strategic Interaction with Computerized Confederate Agents

When playing games of strategic interaction, such as iterated Prisoner’s Dilemma and iterated Chicken Game, people exhibit specific within-game learning (e.g., learning a game’s optimal outcome) as well as transfer of learning between games (e.g., a game’s optimal outcome occurring at a higher proportion when played after another game). The reciprocal trust players develop during the first game is thought to mediate transfer of learning effects. Recently, a computational cognitive model using a novel trust mechanism has been shown to account for human behavior in both games, including the transfer between games. We present the results of a study in which we evaluate the model’s a priori predictions of human learning and transfer in 16 different conditions. The model’s predictive validity is compared against five model variants that lacked a trust mechanism. The results suggest that a trust mechanism is necessary to explain human behavior across multiple conditions, even when a human plays against a non-human agent. The addition of a trust mechanism to the other learning mechanisms within the cognitive architecture, such as sequence learning, instance-based learning, and utility learning, leads to better prediction of the empirical data. It is argued that computational cognitive modeling is a useful tool for studying trust development, calibration, and repair.

59 BASIC BIOLOGICAL SCIENCES↗

Bertrand and Cournot Mean Field Games

We study how continuous time Bertrand and Cournot competitions, in which firms producing similar goods compete with one another by setting prices or quantities respectively, can be analyzed as continuum dynamic mean field games. Interactions are of mean field type in the sense that the demand faced by a producer is affected by the others through their average price or quantity. Motivated by energy or consumer goods markets, we consider the setting of a dynamic game with uncertain market demand, and under the constraint of finite supplies (or exhaustible resources). The continuum game is characterized by a coupled system of partial differential equations: a backward Hamilton–Jacobi–Bellman partial differential equation (PDE) for the value function, and a forward Kolmogorov PDE for the density of players. Asymptotic approximation enables us to deduce certain qualitative features of the game in the limit of small competition. The equilibrium of the game is further studied using numerical solutions, which become very tractable by considering the tail distribution function instead of the density itself. This also allows us to consider Dirac delta distributions to use the continuum game to mimic finite N-player nonzero-sum differential games, the advantage being having to deal with two coupled PDEs instead of N. We find that, in accordance with the two-player game, a large degree of competitive interaction causes firms to slow down production. The continuum system can therefore be used qualitative as an approximation to even small player dynamic games.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Commuting embeddings for parallel strategies in non-local games

Non-local games provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces, which scales additively in the number of qubits. In this work, we show that this additive cost can be reduced by exploiting algebraic embeddings. We introduce two forms of compressions. First, when a referee selects one game from a finite collection of games at random, the game quantum strategy can be implemented using a maximally entangled state of dimension equal to the largest individual game, thereby eliminating the need for repeated state preparations. Second, we establish conditions under which several games can be played simultaneously in parallel on fewer qubits than the tensor product baseline. These conditions are expressed in terms of commuting embeddings of the game algebras. Moreover, we provide a constructive framework for building such embeddings. Using tools from Lie theory, we show that aligning the various game algebras into a common Cartan decomposition enables such a qubit reduction. Beyond the theoretical contribution, our framework casts NLGs as algebraic primitives for distributed and resource-constrained quantum computations and suggested NLGs as a comparable device-independent dimension witness.

Commuting embeddings↗

SIGNAL Game Manual

SIGNAL is a first of its kind experimental wargame developed as part of the Project on Nuclear Gaming (PoNG). In this document we describe the rules and game mechanics associated with the online version of SIGNAL created by team members from the University of California, Berkeley, Sandia National Laboratories, and Lawrence Livermore National Laboratory and sponsored by the Carnegie Corporation of New York. The game was developed as part of a larger research project to develop the experimental wargaming methodology and explore its use on a model scenario: the impact of various military capabilities on conflict escalation dynamics. We discuss the results of this research in a forthcoming paper that will include this manual as an appendix. It is our hope that this manual will both contribute to our players' understanding of the game prior to play and that it will allow for replication of the SIGNAL game environment for future research purposes. The manual begins by introducing the terminology used throughout the document. It then outlines the technical requirements required to run SIGNAL. The following section provides a description of the map, resources, infrastructure, tokens, and action cards used in the game environment. The manual then describes the user interface including the chat functions, trade mechanism, currency and population counts necessary for players to plan their actions. It then turns to the sequence of player actions in the game describing the signaling, action, and upkeep phases that comprise each round of play. It then outlines the use of diplomacy including alliances with minor states and trade between players. The manual also describes the process for scoring the game and determining the winner. The manual concludes with tips for players to remember as they embark upon playing the game.

97 MATHEMATICS AND COMPUTING↗

A formulation and analysis of combat games

Combat which is formulated as a dynamical encounter between two opponents, each of whom has offensive capabilities and objectives is outlined. A target set is associated with each opponent in the event space in which he endeavors to terminate the combat, thereby winning. If the combat terminates in both target sets simultaneously, or in neither, a joint capture or a draw, respectively, occurs. Resolution of the encounter is formulated as a combat game; as a pair of competing event constrained differential games. If exactly one of the players can win, the optimal strategies are determined from a resulting constrained zero sum differential game. Otherwise the optimal strategies are computed from a resulting nonzero sum game. Since optimal combat strategies may frequently not exist, approximate or delta combat games are also formulated leading to approximate or delta optimal strategies. The turret game is used to illustrate combat games. This game is sufficiently complex to exhibit a rich variety of combat behavior, much of which is not found in pursuit evasion games.

Heymann, M.↗

A formulation and analysis of combat games

Combat is formulated as a dynamical encounter between two opponents, each of whom has offensive capabilities and objectives. With each opponent is associated a target in the event space in which he endeavors to terminate the combat, thereby winning. If the combat terminates in both target sets simultaneously or in neither, a joint capture or a draw, respectively, is said to occur. Resolution of the encounter is formulated as a combat game; namely, as a pair of competing event-constrained differential games. If exactly one of the players can win, the optimal strategies are determined from a resulting constrained zero-sum differential game. Otherwise the optimal strategies are computed from a resulting non-zero-sum game. Since optimal combat strategies frequencies may not exist, approximate of delta-combat games are also formulated leading to approximate or delta-optimal strategies. To illustrate combat games, an example, called the turret game, is considered. This game may be thought of as a highly simplified model of air combat, yet it is sufficiently complex to exhibit a rich variety of combat behavior, much of which is not found in pursuit-evasion games.

Heymann, M.↗

The Emergence of Agent-Based Technology as an Architectural Component of Serious Games

The evolution of games as an alternative to traditional simulations in the military context has been gathering momentum over the past five years, even though the exploration of their use in the serious sense has been ongoing since the mid-nineties. Much of the focus has been on the aesthetics of the visuals provided by the core game engine as well as the artistry provided by talented development teams to produce not only breathtaking artwork, but highly immersive game play. Consideration of game technology is now so much a part of the modeling and simulation landscape that it is becoming difficult to distinguish traditional simulation solutions from game-based approaches. But games have yet to provide the much needed interactive free play that has been the domain of semi-autonomous forces (SAF). The component-based middleware architecture that game engines provide promises a great deal in terms of options for the integration of agent solutions to support the development of non-player characters that engage the human player without the deterministic nature of scripted behaviors. However, there are a number of hard-learned lessons on the modeling and simulation side of the equation that game developers have yet to learn, such as: correlation of heterogeneous systems, scalability of both terrain and numbers of non-player entities, and the bi-directional nature of simulation to game interaction provided by Distributed Interactive Simulation (DIS) and High Level Architecture (HLA).

Phillips, Mark↗

On the modeling and agent-based simulation of a cooperative group anagram game

Anagram games (i.e., word construction games in which players use letters to form words) have been researched for some 60 years. Games with individual players are the subject of over 20 published investigations. Moreover, there are many popular commercial anagram games such as Scrabble. Recently, cooperative team play of anagram games has been studied experimentally. With all of this experimental work and the popularity of such games, it is somewhat surprising that very little modeling of anagram games has been done to predict player behavior/actions in them. We devise a cooperative group anagram game and develop an agent-based modeling and simulation framework to capture player interactions of sharing letters and forming words. Our primary goals are to understand, quantitatively predict, and explain aggregate group behavior, through simulations, to inform the design of a group anagram game experimental platform.

97 MATHEMATICS AND COMPUTING↗

History of the Beer Game

This article describes the history of the Beer Game. By triangulating information from literature, archival analysis, and interviews with experts in the field, the main changes in the game over its almost 70-year history are identified. The article discusses three aspects of the game: 1) its structure (phases of its history, stocks and flows, parameters, etc.); 2) the process for playing the game; and 3) the game debrief. The structure of the Beer Game, and the process for running it, have stabilized over the years into what is now a de facto standard approach. Additional work is needed in the game debrief, specifically in the clarification of key insights and messages (depending on the context of the use of the game), in how to communicate such messages to different audiences, and in the development of support materials for its delivery. © 2024 UChicago Argonne, LLC. System Dynamics Review published by John Wiley & Sons Ltd on behalf of System Dynamics Society.

97 MATHEMATICS AND COMPUTING↗