English
Related papers

Related papers: Trains, Games, and Complexity: 0/1/2-Player Motion…

200 papers

We study algorithmic complexity of solving subtraction games in a~fixed dimension with a finite difference set. We prove that there exists a game in this class such that any algorithm solving the game runs in exponential time. Also we prove…

Computational Complexity · Computer Science 2020-01-14 Vladimir Gurvich , Michael Vyalyi

In this work we address a game theoretic variant of the shortest path problem, in which two decision makers (players) move together along the edges of a graph from a given starting vertex to a given destination. The two players take turns…

Discrete Mathematics · Computer Science 2015-06-02 Andreas Darmann , Ulrich Pferschy , Joachim Schauer

Many autonomous agents, such as intelligent vehicles, are inherently required to interact with one another. Game theory provides a natural mathematical tool for robot motion planning in such interactive settings. However, tractable…

Robotics · Computer Science 2023-03-23 Xinjie Liu , Lasse Peters , Javier Alonso-Mora

Difficulty is one of the key drivers of player engagement and it is often one of the aspects that designers tweak most to optimise the player experience; operationalising it is, therefore, a crucial task for game development studios. A…

Artificial Intelligence · Computer Science 2025-03-20 Jeppe Theiss Kristensen , Paolo Burelli

We study the complexity of computing equilibria in binary public goods games on undirected graphs. In such a game, players correspond to vertices in a graph and face a binary choice of performing an action, or not. Each player's decision…

Computer Science and Game Theory · Computer Science 2023-05-22 Max Klimm , Maximilian J. Stahlberg

Locomotion for legged robots poses considerable challenges when confronted by obstacles and adverse environments. Footstep planners are typically only designed for one mode of locomotion, but traversing unfavorable environments may require…

Robotics · Computer Science 2016-08-15 Michael X. Grey , Aaron D. Ames , C. Karen Liu

Locomotion for legged robots poses considerable challenges when confronted by obstacles and adverse environments. Footstep planners are typically only designed for one mode of locomotion, but traversing unfavorable environments may require…

Robotics · Computer Science 2016-10-05 Michael X. Grey , C. Karen Liu , Aaron D. Ames

We analyze some of the many game mechanics available to Link in the classic Legend of Zelda series of video games. In each case, we prove that the generalized game with that mechanic is polynomial, NP-complete, NP-hard and in PSPACE, or…

Computational Complexity · Computer Science 2022-04-01 Jeffrey Bosboom , Josh Brunner , Michael Coulombe , Erik D. Demaine , Dylan H. Hendrickson , Jayson Lynch , Elle Najt

We study the problem of deciding the winner of reachability switching games for zero-, one-, and two-player variants. Switching games provide a deterministic analogue of stochastic games. We show that the zero-player case is NL-hard, the…

Formal Languages and Automata Theory · Computer Science 2023-06-22 John Fearnley , Martin Gairing , Matthias Mnich , Rahul Savani

We analyze the pedestrian evacuation of a rectangular room with a single door considering a Lattice Gas scheme with the addition of behavioral aspects of the pedestrians. The movement of the individuals is based on random and rational…

Adaptation and Self-Organizing Systems · Physics 2015-06-17 S. Bouzat , M. N. Kuperman

Recently, Dohrau et al. studied a zero-player game on switch graphs and proved that deciding the termination of the game is in NP $\cap$ coNP. In this short paper, we show that the search version of this game on switch graphs, i.e., the…

Computational Complexity · Computer Science 2017-01-09 Karthik C. S.

Building agents that can explore their environments intelligently is a challenging open problem. In this paper, we make a step towards understanding how a hierarchical design of the agent's policy can affect its exploration capabilities.…

Machine Learning · Computer Science 2018-11-19 Maruan Al-Shedivat , Lisa Lee , Ruslan Salakhutdinov , Eric Xing

Temporal graphs are a popular modelling mechanism for dynamic complex systems that extend ordinary graphs with discrete time. Simply put, time progresses one unit per step and the availability of edges can change with time. We consider the…

Logic in Computer Science · Computer Science 2024-01-30 Pete Austin , Sougata Bose , Patrick Totzke

In the ALICE experiment hundreds of users are analyzing big datasets on a Grid system. High throughput and short turn-around times are achieved by a centralized system called the LEGO trains. This system combines analysis from different…

High Energy Physics - Experiment · Physics 2019-08-13 Markus Zimmermann

We study games with reachability objectives under energy constraints. We first prove that under strict energy constraints (either only lower-bound constraint or interval constraint), those games are LOGSPACE-equivalent to energy games with…

Computer Science and Game Theory · Computer Science 2019-09-18 Loïc Hélouët , Nicolas Markey , Ritam Raha

Factorio is a 2D construction and management simulation video game about building automated factories to produce items of increasing complexity. A core feature of the game is its blueprint system, which allows players to easily save and…

Artificial Intelligence · Computer Science 2023-10-04 Sean Patterson , Joan Espasa , Mun See Chang , Ruth Hoffmann

Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity. A successful puzzle has to be both captivating and challenging, and it has been suggested that this…

Computational Complexity · Computer Science 2016-03-04 Matteo Almanza , Stefano Leucci , Alessandro Panconesi

Recent successes of game-theoretic formulations in ML have caused a resurgence of research interest in differentiable games. Overwhelmingly, that research focuses on methods and upper bounds on their speed of convergence. In this work, we…

Machine Learning · Computer Science 2020-09-16 Adam Ibrahim , Waïss Azizian , Gauthier Gidel , Ioannis Mitliagkas

When a large collection of objects (e.g., robots, sensors, etc.) has to be deployed in a given environment, it is often required to plan a coordinated motion of the objects from their initial position to a final configuration enjoying some…

Data Structures and Algorithms · Computer Science 2014-07-03 Davide Bilò Luciano Gualà , Stefano Leucci , Guido Proietti

Game-theoretic approaches are envisioned to bring human-like reasoning skills and decision-making processes for autonomous vehicles (AVs). However, challenges including game complexity and incomplete information still remain to be addressed…

Systems and Control · Electrical Eng. & Systems 2023-12-01 Mushuang Liu , H. Eric Tseng , Dimitar Filev , Anouck Girard , Ilya Kolmanovsky