skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Thursday, June 12 until 2:00 AM ET on Friday, June 13 due to maintenance. We apologize for the inconvenience.


Title: Game System Models: Toward Semantic Foundations for Technical Game Analysis, Generation, and Design
Game system models introduce abstractions over games in order to support their analysis, generation, and design. While excellent, models to date leave tacit what they abstract over, why they are ontologically adequate, and how they would be realized in the engine underlying the game. In this paper we model these abstraction gaps via the first-order modal mu-calculus. We use it to reify the link between engines to our game interaction model, a player-computer interaction framework grounded in the Game Ontology Project. Through formal derivation and justification, we contend our work is a useful code studies perspective that affords better understanding the semantics underlying game system models in general.  more » « less
Award ID(s):
2046294
PAR ID:
10435220
Author(s) / Creator(s):
; ;
Publisher / Repository:
AAAI
Date Published:
Journal Name:
Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment
Volume:
18
Issue:
1
ISSN:
2326-909X
Page Range / eLocation ID:
10 - 17
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Hansen, Kristoffer Arnsfelt; Liu, Tracy Xiao; Malekian, Azarakhsh (Ed.)
    Empirical game-theoretic analysis (EGTA) is a general framework for reasoning about complex games using agent-based simulation. Data from simulating select strategy profiles is employed to estimate a cogent and tractable game model approximating the underlying game. To date, EGTA methodology has focused on game models in normal form; though the simulations play out in sequential observations and decisions over time, the game model abstracts away this temporal structure. Richer models of extensive-form games (EFGs) provide a means to capture temporal patterns in action and information, using tree representations. We propose tree-exploiting EGTA (TE-EGTA), an approach to incorporate EFG models into EGTA. TE-EGTA constructs game models that express observations and temporal organization of activity, albeit at a coarser grain than the underlying agent-based simulation model. The idea is to exploit key structure while maintaining tractability. We establish theoretically and experimentally that exploiting even a little temporal structure can vastly reduce estimation error in strategy-profile payoffs compared to the normal-form model. Further, we explore the implications of EFG models for iterative approaches to EGTA, where strategy spaces are extended incrementally. Our experiments on several game instances demonstrate that TE-EGTA can also improve performance in the iterative setting, as measured by the quality of equilibrium approximation as the strategy spaces are expanded. 
    more » « less
  2. The classical Kuramoto model is studied in the setting of an infinite horizon mean field game. The system is shown to exhibit both syn- chronization and phase transition. Incoherence below a critical value of the interaction parameter is demonstrated by the stability of the uni- form distribution. Above this value, the game bifurcates and develops self-organizing time homogeneous Nash equilibria. As interactions get stronger, these stationary solutions become fully synchronized. Results are proved by an amalgam of techniques from nonlinear partial dif- ferential equations, viscosity solutions, stochastic optimal control and stochastic processes. ARTICLE HISTORY Received 23 October 2022 Accepted 17 June 2023 KEYWORDS Mean field games; Kuramoto model; synchronization; viscosity solutions 2020 MATHEMATICS SUBJECT CLASSIFICATION 35Q89; 35D40; 39N80; 91A16; 92B25 1. Introduction Originally motivated by systems of chemical and biological oscillators, the classical Kuramoto model [1] has found an amazing range of applications from neuroscience to Josephson junctions in superconductors, and has become a key mathematical model to describe self organization in complex systems. These autonomous oscillators are coupled through a nonlinear interaction term which plays a central role in the long time behavior of the system. While the system is unsynchronized when this term is not sufficiently strong, fascinatingly they exhibit an abrupt transition to self organization above a critical value of the interaction parameter. Synchronization is an emergent property that occurs in a broad range of complex systems such as neural signals, heart beats, fire-fly lights and circadian rhythms, and the Kuramoto dynamical system is widely used as the main phenomenological model. Expository papers [2, 3] and the references therein provide an excellent introduction to the model and its applications. The analysis of the coupled Kuramoto oscillators through a mean field game formalism is first explored by [4, 5] proving bifurcation from incoherence to coordination by a formal linearization and a spectral argument. [6] further develops this analysis in their application to a jet-lag recovery model. We follow these pioneering studies and analyze the Kuramoto model as a discounted infinite horizon stochastic game in the limit when the number of oscillators goes to infinity. We treat the system of oscillators as an infinite particle system, but instead of positing the dynamics of the particles, we let the individual particles endogenously determine their behaviors by minimizing a cost functional and hopefully, settling in a Nash equilibrium. Once the search for equilibrium is recast in this way, equilibria are given by solutions of nonlinear systems. Analytically, they are characterized by a backward dynamic CONTACT H. Mete Soner soner@princeton.edu Department of Operations Research and Financial Engineering, Prince- ton University, Princeton, NJ, 08540, USA. © 2023 Taylor & Francis Group, LLC 
    more » « less
  3. Abstract Recent developments of eco-evolutionary models have shown that evolving feedbacks between behavioral strategies and the environment of game interactions, leading to changes in the underlying payoff matrix, can impact the underlying population dynamics in various manners. We propose and analyze an eco-evolutionary game dynamics model on a network with two communities such that players interact with other players in the same community and those in the opposite community at different rates. In our model, we consider two-person matrix games with pairwise interactions occurring on individual edges and assume that the environmental state depends on edges rather than on nodes or being globally shared in the population. We analytically determine the equilibria and their stability under a symmetric population structure assumption, and we also numerically study the replicator dynamics of the general model. The model shows rich dynamical behavior, such as multiple transcritical bifurcations, multistability, and anti-synchronous oscillations. Our work offers insights into understanding how the presence of community structure impacts the eco-evolutionary dynamics within and between niches. 
    more » « less
  4. A traffic system can be interpreted as a multiagent system, wherein vehicles choose the most efficient driving approaches guided by interconnected goals or strategies. This paper aims to develop a family of mean field games (MFG) for generic second-order traffic flow models (GSOM), in which cars control individual velocity to optimize their objective functions. GSOMs do not generally assume that cars optimize self-interested objectives, so such a game-theoretic reinterpretation offers insights into the agents’ underlying behaviors. In general, an MFG allows one to model individuals on a microscopic level as rational utility-optimizing agents while translating rich microscopic behaviors to macroscopic models. Building on the MFG framework, we devise a new class of second-order traffic flow MFGs (i.e., GSOM-MFG), which control cars’ acceleration to ensure smooth velocity change. A fixed-point algorithm with fictitious play technique is developed to solve GSOM-MFG numerically. In numerical examples, different traffic patterns are presented under different cost functions. For real-world validation, we further use an inverse reinforcement learning approach (IRL) to uncover the underlying cost function on the next-generation simulation (NGSIM) data set. We formulate the problem of inferring cost functions as a min-max game and use an apprenticeship learning algorithm to solve for cost function coefficients. The results show that our proposed GSOM-MFG is a generic framework that can accommodate various cost functions. The Aw Rascle and Zhang (ARZ) and Light-Whitham-Richards (LWR) fundamental diagrams in traffic flow models belong to our GSOM-MFG when costs are specified. History: This paper has been accepted for the Transportation Science Special Issue on ISTTT25 Conference. Funding: X. Di is supported by the National Science Foundation [CAREER Award CMMI-1943998]. E. Iacomini is partially supported by the Italian Research Center on High-Performance Computing, Big Data and Quantum Computing (ICSC) funded by MUR Missione 4-Next Generation EU (NGEU) [Spoke 1 “FutureHPC & BigData”]. C. Segala and M. Herty thank the Deutsche Forschungsgemeinschaft (DFG) for financial support [Grants 320021702/GRK2326, 333849990/IRTG-2379, B04, B05, and B06 of 442047500/SFB1481, HE5386/18-1,19-2,22-1,23-1,25-1, ERS SFDdM035; Germany’s Excellence Strategy EXC-2023 Internet of Production 390621612; and Excellence Strategy of the Federal Government and the Länder]. Support through the EU DATAHYKING is also acknowledged. This work was also funded by the DFG [TRR 154, Mathematical Modelling, Simulation and Optimization Using the Example of Gas Networks, Projects C03 and C05, Project No. 239904186]. Moreover, E. Iacomini and C. Segala are members of the Indam GNCS (Italian National Group of Scientific Calculus). 
    more » « less
  5. null (Ed.)
    Systems involving agriculture and natural resources (AGNR) management and representing integrations of biologic, geologic, socio-economic, and climatic characteristics are incredibly complex. AGNR managers purport using a systems-oriented mental model while many observed management and policy strategies remain linear or symptom-driven. To improve AGNR professionals’ systems thinking abilities, two programs, the King Ranch® Institute for Ranch Management at Texas A&M University-Kingsville (KRIRM) and the Honors College at South Dakota State University (SDSUHC), implemented the famous Production Distribution Simulation Game (a.k.a. the Beer Game) into their programs beginning in 2003 and 2011. A Beer Game database consisting of 10 years of trials or over 270 individual players was compared to seminal work in the literature as well as to one another. We found that AGNR managers and students performed worse than players in a seminal Beer Game study. More interestingly, we found that younger players adapted more readily to inventory surpluses by reducing the order rates and effective inventories significantly when compared to older players (p < 0.10 for retailer and distributors, and p < 0.05 for wholesales and factories). We substantiated our results to those in more recent studies of age-related decision-making and in the context of common learning disabilities. Lastly, we discuss some implications of such decision-making on 21st century AGNR problems and encourage AGNR disciplines to better integrate system dynamics-based education and collaboration in order to better prepare for such complex issues. 
    more » « less