English
Related papers

Related papers: Infinite-State Energy Games

200 papers

Evolutionary game theory is a powerful mathematical framework to study how intelligent individuals adjust their strategies in collective interactions. It has been widely believed that it is impossible to unilaterally control players'…

Optimization and Control · Mathematics 2021-08-31 Renfei Tan , Qi Su , Bin Wu , Long Wang

Repeated games have a long tradition in the behavioral sciences and evolutionary biology. Recently, strategies were discovered that permit an unprecedented level of control over repeated interactions by enabling a player to unilaterally…

Populations and Evolution · Quantitative Biology 2016-10-25 Alex McAvoy , Christoph Hauert

Motivated by the success of domination games and by a variation of the coloring game called the indicated coloring game, we introduce a version of domination games called the indicated domination game. It is played on an arbitrary graph $G$…

Combinatorics · Mathematics 2024-03-28 Boštjan Brešar , Csilla Bujtás , Vesna Iršič , Douglas F. Rall , Zsolt Tuza

We study the class of potential games that are also graphical games with respect to a given graph $G$ of connections between the players. We show that, up to strategic equivalence, this class of games can be identified with the set of…

Probability · Mathematics 2018-07-27 Yakov Babichenko , Omer Tamuz

We consider infinite-state Attacker-Defender games with reachability objectives. The results of the paper are twofold. Firstly we prove a new language-theoretic result for weighted automata on infinite words and show its encoding into the…

Formal Languages and Automata Theory · Computer Science 2015-04-28 Vesa Halava , Tero Harju , Reino Niskanen , Igor Potapov

Stochastic games are an important class of problems that generalize Markov decision processes to game theoretic scenarios. We consider finite state two-player zero-sum stochastic games over an infinite time horizon with discounted rewards.…

Optimization and Control · Mathematics 2008-06-17 Parikshit Shah , Pablo A. Parrilo

We introduce a game where players selfishly choose a resource and endure a cost depending on the number of players choosing nearby resources. We model the influences among resources by a weighted graph, directed or not. These games are…

Discrete Mathematics · Computer Science 2026-04-08 David Auger , Johanne Cohen , Antoine Lobstein

Priced timed games are optimal-cost reachability games played between two players---the controller and the environment---by moving a token along the edges of infinite graphs of configurations of priced timed automata. The goal of the…

Logic in Computer Science · Computer Science 2015-07-22 Shibashis Guha , Shankara Narayanan Krishna , Lakshmi Manasa , Ashutosh Trivedi

This paper considers a class of two-player zero-sum games on directed graphs whose vertices are equipped with random payoffs of bounded support known by both players. Starting from a fixed vertex, players take turns to move a token along…

Optimization and Control · Mathematics 2024-01-30 Luc Attia , Lyuben Lichev , Dieter Mitsche , Raimundo Saona , Bruno Ziliotto

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…

Computer Science and Game Theory · Computer Science 2017-04-05 Thomas Brihaye , Gilles Geeraerts , Axel Haddad , Engel Lefaucheux , Benjamin Monmege

Escalation in games is when agents keep playing forever. Based on formal proofs we claim that if agents assume that resource are infinite, escalation is rational.

Logic in Computer Science · Computer Science 2020-06-29 Pierre Lescanne

We introduce two-level discounted games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted game and the lower level game is an undiscounted reachability game. Two-level games model…

Logic in Computer Science · Computer Science 2010-06-09 Krishnendu Chatterjee , Rupak Majumdar

Definable zero-sum stochastic games involve a finite number of states and action sets, reward and transition functions that are definable in an o-minimal structure. Prominent examples of such games are finite, semi-algebraic or globally…

Optimization and Control · Mathematics 2015-01-05 Jérôme Bolte , Stéphane Gaubert , Guillaume Vigeral

We introduce a class of cooperative games induced by weighted directed graphs. Specifically, the coalitional value combines an internal interaction term given by the induced subgraph game with an external component based on minimal incoming…

Computer Science and Game Theory · Computer Science 2026-05-19 David Ryzák , Tomáš Kroupa

Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modelling the cost of spending time in a state and executing an action, respectively). The goals of the…

Computer Science and Game Theory · Computer Science 2023-06-22 Thomas Brihaye , Gilles Geeraerts , Axel Haddad , Engel Lefaucheux , Benjamin Monmege

We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current…

Computational Complexity · Computer Science 2012-02-06 Urban Larsson , Johan Wästlund

A generalized model of games is proposed, in which cooperative games and non-cooperative games are special cases. Some games that are neither cooperative nor non-cooperative can be expressed and analyzed. The model is based on relationships…

Computer Science and Game Theory · Computer Science 2016-10-10 Jiawei Li

This paper presents a learning dynamic with almost sure convergence guarantee for any stochastic game with turn-based controllers (on state transitions) as long as stage-payoffs induce a zero-sum or identical-interest game. Stage-payoffs…

Computer Science and Game Theory · Computer Science 2023-10-11 Muhammed O. Sayin

We conduct a comprehensive analysis of the discrete-time exponential-weights dynamic with a constant step size on all general-sum and symmetric $2 \times 2$ normal-form games, i.e. games with $2$ pure strategies per player, and where the…

Computer Science and Game Theory · Computer Science 2026-01-22 Guanghui Wang , Krishna Acharya , Lokranjan Lakshmikanthan , Juba Ziani , Vidya Muthukumar

We are interested in the convergence of the value of n-stage games as n goes to infinity and the existence of the uniform value in stochastic games with a general set of states and finite sets of actions where the transition is commutative.…

Optimization and Control · Mathematics 2016-04-22 Xavier Venel