Search NASA⌕ Search

SEARCH · Search NASA

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Application-level benchmarking of quantum computers using nonlocal game strategies

In a nonlocal game, two noncommunicating players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game. Quantum strategies allow players to optimally win some games by performing joint measurements on a shared entangled state, but computing these strategies can be challenging. We present a variational quantum algorithm to compute quantum strategies for nonlocal games by encoding the rules of a nonlocal game into a Hamiltonian. We show how this algorithm can generate a short-depth optimal quantum strategy for a graph coloring game with a quantum advantage. This quantum strategy is then evaluated on fourteen different quantum hardware platforms to demonstrate its utility as a benchmark. Finally, we discuss potential sources of errors that can explain the observed decreased performance of the executed task and derive an expression for the number of samples required to accurately estimate the win rate in the presence of noise.

nonlocal games↗
DOE OSTI2026

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↗
DOE OSTI2020

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↗
DOE OSTI2024

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↗
DOE OSTI2023

Designing interagency responses to wicked problems: A viable system model board game

Government agencies struggle to address wicked problems because they are open-ended, highly interdependent issues that cross agency, stakeholder, jurisdictional, and geopolitical boundaries. While both quantitative modelling and qualitative problem structuring methodologies have been used to support interagency decision making in the past, co-designing an effective interagency organization to collaboratively tackle wicked problems is more challenging. Few approaches have been developed to enable such efforts. This paper explains how the viable system model (VSM) was implemented through a board game, which was employed to co-design an interagency meta-organization that would be capable of more effectively collaborating to jointly address a wicked problem: international organized drug crime and its interface with local gangs in Chicago, USA. The board game was developed to make the VSM easier for the participants to learn, given that the cybernetic language and engineering-influenced diagrams in the original literature can be off-putting to leaders and managers. The board game was used as the final stage of a multi-method, systemic approach, which involved boundary critique and problem structuring as well as deployment of the VSM. The research findings indicate that the VSM board game, used as part of a larger mixed-methods systemic intervention, contributes to building trust in the value of systems thinking amongst the participants, and sets up a rich context for collaboration on multi-agency co-design. The game therefore offers significant promise as part of the co-design of interagency responses to wicked problems because it creates an embodied process for stakeholders to learn about the VSM. It also reduces the work involved in this learning. Thus, the game enables an effective appropriation of the VSM language and criteria.

Business & Economics↗
DOE OSTI2025

Braiding for the win: Harnessing braiding statistics in topological states to play quantum games

Nonlocal quantum games provide proof of principle that quantum resources can confer an advantage at certain tasks. They also provide a compelling way to explore the computational utility of phases of matter on quantum hardware. In a recent paper [O. Hart et al., Phys. Rev. Lett. 134, 130602 (2025)], we demonstrated that a toric code resource state conferred advantage at a certain nonlocal game, which remained robust to small deformations of the resource state. In this paper we demonstrate that this robust advantage is a generic property of resource states drawn from topological or fracton ordered phases of quantum matter. To this end, we illustrate how several other states from paradigmatic topological and fracton ordered phases can function as resources for suitably defined nonlocal games, notably the three-dimensional toric-code phase, the X-cube fracton phase, and the double-semion phase. The key in every case is to design a nonlocal game that harnesses the characteristic braiding processes of a quantum phase as a source of contextuality. We unify the strategies that take advantage of mutual statistics by relating the operators to be measured to order and disorder parameters of an underlying generalized symmetry-breaking phase transition. Additionally, by connecting the win probability to twist products, we show that success at the game serves as a many-body entanglement witness. Namely, if the players implement a perfect quantum strategy on large length scales, the quantum state they share cannot be connected to a trivial product state via a constant-depth local unitary circuit. Lastly, we massively generalize the family of games that admit perfect strategies when codewords of homological quantum error-correcting codes are used as resources.

Fractons↗
DOE OSTI2025

A Game-Theoretic Quantum Algorithm for Solving Magic Squares

Variational quantum algorithms (VQAs) offer a promising near-term approach to finding optimal quantum strategies for playing non-local games. These games test quantum correlations beyond classical limits and enable entanglement verification. In this work, we present a variational framework for the Magic Square Game (MSG), a two-player non-local game with perfect quantum advantage. We construct a value Hamiltonian that encodes the game’s parity and consistency constraints, then optimize parameterize quantum circuits to minimize this cost. Our approach build on the stabilizer formalism, leverages commutation structure for circuit design, and is hardware-efficient. Compared to existing work, our contribution emphasizes algebraic structure an interpretability. We validate our method through numerical experiments and outline generalizations to larger games.

Chehade, Sarah [ORNL]↗
DOE OSTI2026

The Hydropower Game: An Interactive Learning Tool for the Future Hydropower Workforce

This report documents a Seedling project supported by the U.S. Department of Energy (DOE) Water Power Technologies Office (WPTO), conducted by Argonne National Laboratory (ANL) and the National Laboratory of the Rockies (NLR). The Seedling and Sapling Program provides small grants over short duration to enable early-stage research at national laboratories. This funding mechanism is intended to cultivate innovative ideas and expand research road maps in hydropower and marine energy technologies. Under this Seedling award, the project team developed an educational outreach tool, or “serious game”, built in Python and powered by the Pygame library, aimed at teaching fundamental hydropower concepts through an engaging, interactive learning experience. The game features multiple lessons covering several hydropower topics while allowing for expansion and customization in the instance of future funding availability: • Hydropower Plant Types: Players explore and compare the mechanics and applications of run-of-river, dam hydropower, and pumped-storage hydropower. • Flow Dynamics and Power Generation: Interactive tasks demonstrate how release rate and hydraulic head combine to determine power output. • Grid Operations and Load Following: Simulations illustrate how hydropower facilities respond to fluctuating electricity demand to balance the grid. • Market Integration: Levels scaffold understanding of how hydropower interfaces with the broader energy market, including operational and economic considerations. The tool was showcased at several science, technology, engineering, and mathematics (STEM) outreach events, where it was demoed to students, educators, and the general public. These events provided valuable opportunities to collect feedback on the gameplay, storyline, and educational objectives from a wide audience. The game was presented at STEMapalooza, Introduce a Girl to Engineering Day, STEMCON, and Clean Currents 2025. Insights gathered during these demonstrations informed refinements to the game’s user experience and strengthened its effectiveness as an educational tool for teaching hydropower concepts. This report outlines the game’s design philosophy, educational objectives, technical implementation, user experience insights, and potential for broader deployment within educational and workforce development contexts. It emphasizes how gamified learning can demystify complex hydropower science and inspire interest in water-power technologies. The project’s success demonstrates the value of Seedling funding in fostering creative, lowcost educational tools that support DOE’s mission to advance energy literacy and innovation. The report concludes with recommendations for expanding the tool by adding new levels, integrating assessment metrics, and exploring commercialization or deployment pathways through future Sapling funding. The official webpage of the Hydropower Game, which includes a link to the educational tool, can be accessed at www.anl.gov/hydropower/hydropower-game.

13 HYDRO ENERGY↗
DOE OSTI2025

A sequential Attacker-Defender game for distribution systems resilience enhancement against extreme weather events

Improving distribution system resilience against frequent extreme weather events is important for reliable power system operations. Especially when dealing with events such as hurricanes that have short-term predictions, proactive pre-event preparedness plays a vital role in system resilience performance. In this paper, we propose a novel approach to construct pre-event resource allocation plans for system operators to cope with upcoming threats through a sequential attacker-defender game framework. The sequential attacker-defender game is designed to model the interaction between the extreme weather and the system operator. In each round of the game, the attacker and the defender sequentially update their current strategies by accounting for the opponent’s action set. The attacker model is formulated as a bi-level problem to identify the severe outage scenarios, and the defender model is formulated as a two-stage optimization problem to determine the allocation of restoration resources including mobile responsive resources and repair crews. Two scale-reduction strategies are proposed to ensure the scalability of the game scheme. Finally, case studies on the IEEE 33-bus and a 7149-node practical utility system validate the effectiveness of the proposed sequential game and the efficiency of the scale-reduction strategies.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Cyber risk assessment and investment optimization using game theory and ML-based anomaly detection and mitigation for wide-area control in smart grids

The electric power grid is increasingly becoming susceptible to cyber attacks that exploit vulnerabilities in the smart grid control, information, and physical layers. Successful cyber attacks can have catastrophic impacts on the social and economic well-being of any nation all over the globe. It has, thus, become imperative to secure the smart grid against such adversarial actions to ensure stable, secure, and reliable operation of the grid. The existing research and industry practices prove to be inadequate in terms of providing pragmatic and effective defense methodologies and measures for long-term cybersecurity planning and real-time cybersecurity for grid operation. For example, existing works lack models that incorporate uncertain behavior of cyber-attackers and pragmatic defense measures for cyber risk assessment and cybersecurity investment optimization which often provide unreliable and strictly qualitative solutions to these problems. At the same time, with the growing number of cyber incidents in the grid, there still exists a need to develop attack-resilient algorithms for wide-area monitoring, protection, and control (WAMPAC) applications like the wide-area voltage control systems (WAVCS) for Flexible AC Transmissions Systems (FACTS) that lack in scalable and feasible solutions from the cybersecurity perspective. This dissertation proposes novel models and methodologies for: (1) Cybersecurity planning, and (2) Cybersecurity for system operation. The cybersecurity planning is achieved through cyber risk assessment and cybersecurity resource investment optimization for long-term cybersecurity of the grid using game theory and attack-defense trees. Cybersecurity for system operation consists of development of cyber anomaly detection and mitigation algorithms for flexible AC transmission system (FACTS) controller-based wide-area voltage control systems (WAVCS) using machine learning (ML), and software defined networking-based moving target defense network routing for achieving real-time cyber-physical security for grid operations. This is followed by hardware-in-the-loop (HIL) implementation and evaluation of these attack prevention, detection, and mitigation algorithms and methodologies showcasing their feasibility in a close to real-world environment. For cybersecurity planning, a novel approach involving a combination of game theory and attack defense trees (ADT) for optimal cybersecurity resource allocation in the smart grid is proposed. This methodology involves modeling of the cyber-physical smart grid substations as ADTs, defining attacker costs, defense costs, and attack probabilities for attack access points. Using game theoretical formulation, optimal defense strategies for the defender of the system to invest cybersecurity resources in the grid are obtained. Additionally, a game-theoretic framework is developed for quantitative cyber-physical risk assessment of the grid under a dynamically changing cyber threat space and uncertain behavior of cyber attackers which is further used to optimize investments in the smart grid's cybersecurity resources. The attacker, defender, and the smart grid system are modeled while incorporating attacker-stochasticity and federal guidelines for smart grid cybersecurity. This allows quantification of threat, vulnerabilities, and attack impact of the grid for quantitative risk assessment. The defender's budget to invest in the security resources in the grid is optimized based on the strategies leading to minimum system risk. The evaluation of the proposed solutions highlight the feasibility for practical implementation of these methodologies and algorithms in the smart grid, while taking the federal requirements and guidelines for smart grid security into consideration. For achieving cybersecurity for system operation, attack prevention, detection, and mitigation algorithms and methodologies are developed specifically for FACTS-based WAVCS. Anomaly detection and mitigation in the WAVCS are achieved using algorithms based on machine learning which involves offline training and testing of ML models with CPS datasets incorporating physics-based features that allow accurate distinction between system faults and cyber attacks. For attack prevention, a methodology based on software defined network (SDN)-based moving target defense (MTD) network routing is proposed that enables prevention of Denial of Service (DoS) type attacks on the smart grid communication system. Subsequently, these methodologies and algorithms are implemented and evaluated on an HIL testbed that allows for real-time attack prevention, detection, and mitigation of emulated cyber attacks on the WAVCS in a close to real-world environment. The results show highly accurate and efficient performance of the implemented algorithms and methodologies with the smart grid system operating within the NERC's system operation limits even in the presence of DoS and data integrity cyber attacks. This work opens up future research opportunities in other directions such as (1) Expanding cybersecurity planning methodologies to real-time cyber contingency analysis with different game formulations; and (2) Applying the cybersecurity for system operation algorithms to broader categories of wide-area control applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

A non-cooperative meta-modeling game for automated third-party calibrating, validating and falsifying constitutive laws with parallelized adversarial attacks

The evaluation of constitutive models, especially for high-risk and high-regret engineering applications, requires efficient and rigorous third-party calibration, validation and falsification. While there are numerous efforts to develop paradigms and standard procedures to validate models, difficulties may arise due to the sequential, manual, and often biased nature of the commonly adopted calibration and validation processes, thus slowing down data collections, hampering the progress towards discovering new physics, increasing expenses and possibly leading to misinterpretations of the credibility and application ranges of proposed models. This work attempts to introduce concepts from game theory and machine learning techniques to overcome many of these existing difficulties. Here, we introduce an automated meta-modeling game where two competing AI agents systematically generate experimental data to calibrate a given constitutive model and to explore its weakness such that the experiment design and model robustness can be improved through competitions. The two agents automatically search for the Nash equilibrium of the meta-modeling game in an adversarial reinforcement learning framework without human intervention. In particular, a protagonist agent seeks to find the more effective ways to generate data for model calibrations, while an adversary agent tries to find the most devastating test scenarios that expose the weaknesses of the constitutive model calibrated by the protagonist. By capturing all possible design options of the laboratory experiments into a single decision tree, we recast the design of experiments as a game of combinatorial moves that can be resolved through deep reinforcement learning by the two competing players. Our adversarial framework emulates idealized scientific collaborations and competitions among researchers to achieve a better understanding of the application range of the learned material laws and prevent misinterpretations caused by conventional AI-based third-party validation. Numerical examples are given to demonstrate the wide applicability of the proposed meta-modeling game with adversarial attacks on both human-crafted constitutive models and machine learning models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Tactile Game System

The board game industry revenue has seen rapid growth from 6.2 billion USD to a projected 8.6 billion USD in revenue from 2018 to 2024 indicating an increased demand for this style of product. Inflation, shipping and the cost of raw materials have increased the cost for producing board games. This increased the barrier of entry and reduces profit margins. Many people lose the chance to experience much of the catalogue of modern hobby board games because of this. There is a need for a digital and low-cost solution for buyers to fulfill demand and create a steady supply while maintaining the characteristics that make board games attractive to consumers. Lowering the barrier of entry will allow for more consumers to enter the market and provide a catalyst for growth in the board game community.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Non-Cooperative Game-Based Distributed Beam Scheduling Framework for 5G Millimeter-Wave Cellular Networks

Here, this paper studies the problem of distributed beam scheduling for 5G millimeter-Wave (mm-Wave) cellular networks where base stations (BSs) belonging to different operators share the same spectrum without centralized coordination among them. Our goal is to design efficient distributed scheduling algorithms to maximize the network utility, which is a function of the achieved throughput by the user equipment (UEs), subject to the average and instantaneous power consumption constraints of the BSs. We propose a Media Access Control (MAC) and a power allocation/adaptation mechanism utilizing the Lyapunov stochastic optimization framework and non-cooperative games. In particular, we first decompose the original utility maximization problem into two sub-optimization problems for each time frame, which are a convex optimization problem and a non-convex optimization problem, respectively. By formulating the distributed scheduling problem as a non-cooperative game where each BS is a player attempting to optimize its own utility, we provide a distributed solution to the non-convex sub-optimization problem via finding the Nash Equilibrium (NE) of the game whose weights are determined optimally by the Lyapunov optimization framework. Finally, we conduct simulation under various network settings to show the effectiveness of the proposed game-based beam scheduling algorithm in comparison to that of several reference schemes.

42 ENGINEERING↗
DOE OSTI2025

Dynamic probabilistic risk assessment and game theory for cyber security risk analysis in nuclear power plants

Nuclear Power Plants and energy systems have become more prone to cyber-attacks with their digitalization and the increased use of smart equipment. Hence, it is important to quantify the risk associated with cyber-attacks in such systems. Dynamic Probabilistic Risk Assessment which involves studying the evolution of a system due to random events and operator and attacker actions during a cyber-attack by employing a physics-based model of the system is a suitable framework to quantify cybersecurity risk in nuclear power plants. In addition to the plant dynamics, it is also important to model the strategies of the attackers and plant operators for an effective cybersecurity risk assessment. Game theory provides a set of necessary tools to model such strategic interactions. In this research, a framework that integrates dynamic probabilistic risk assessment with game theory for cybersecurity risk analysis in nuclear power plants is presented. The mathematical formulation is derived based on the theory of continuous event trees. We propose a game theory based action model, that utilizes physics-based rewards to define the strategies of attackers and operators at every decision epoch. As a case study, the risk associated with cyber-attacks on the digital components in the secondary side of a pressurized water reactor is studied using a reduced order model. A set of attacker actions and a set of operator actions are defined for the system. The operator and attacker interactions were modelled using simultaneous game, their action policies were computed using the concept of mixed strategy Nash equilibrium and the evolution of the system was studied.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Quantum blackjack: Advantages offered by quantum strategies in communication-limited games

Here, we examine the advantages that quantum strategies afford in communication-limited games. Inspired by the card game blackjack, we focus on cooperative, two-party sequential games in which a single classical bit of communication is allowed from the player who moves first to the player who moves second. Within this setting, we explore the usage of quantum entanglement between the players and find analytic and numerical conditions for quantum advantage over classical strategies. Furthermore, using these conditions, we study a family of blackjack-type games with varying numbers of card types, and find a range of parameters where quantum advantage is achieved.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Playing Nonlocal Games across a Topological Phase Transition on a Quantum Computer

Many-body quantum games provide a natural perspective on phases of matter in quantum hardware, crisply relating the quantum correlations inherent in phases of matter to the securing of quantum advantage at a device-oriented task. In this Letter, we introduce a family of multiplayer quantum games for which topologically ordered phases of matter are a resource yielding quantum advantage. Unlike previous examples, quantum advantage persists away from the exactly solvable point and is robust to arbitrary local perturbations, irrespective of system size. We demonstrate this robustness experimentally on Quantinuum’s H1-1 quantum computer by playing the game with a continuous family of randomly deformed toric code states that can be created with constant-depth circuits leveraging midcircuit measurements and unitary feedback. We are thus able to tune through a topological phase transition—witnessed by the loss of robust quantum advantage—on currently available quantum hardware. This behavior is contrasted with an analogous family of deformed Greenberger-Horne-Zeilinger states, for which arbitrarily weak local perturbations destroy quantum advantage in the thermodynamic limit. Lastly, we discuss a topological interpretation of the game, which leads to a natural generalization involving an arbitrary number of players.

97 MATHEMATICS AND COMPUTING↗