English
Related papers

Related papers: Polytopal Stochastic Games

200 papers

Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective.…

Computer Science and Game Theory · Computer Science 2023-07-14 Christel Baier , Krishnendu Chatterjee , Tobias Meggendorfer , Jakob Piribauer

The sequential equilibrium is a standard solution concept for extensive-form games with imperfect information that includes an explicit representation of the players' beliefs. An assessment consisting of a strategy and a belief is a…

Computer Science and Game Theory · Computer Science 2024-02-08 Moritz Graf , Thorsten Engesser , Bernhard Nebel

This paper develops a unified framework for zero-sum games in which both the pure strategies and the payoff matrices contain complex-valued entries. By leveraging a linear isomorphism between complex and real vector spaces, we extend key…

General Mathematics · Mathematics 2026-05-21 Raneem Madani , Abdel Lisser , Zeno Toffano

In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always…

Computer Science and Game Theory · Computer Science 2012-09-17 Yaron Velner , Krishnendu Chatterjee , Laurent Doyen , Thomas A. Henzinger , Alexander Rabinovich , Jean-Francois Raskin

Turn-based discounted-sum games are two-player zero-sum games played on finite directed graphs. The vertices of the graph are partitioned between player 1 and player 2. Plays are infinite walks on the graph where the next vertex is decided…

Computer Science and Game Theory · Computer Science 2024-05-21 Ali Asadi , Krishnendu Chatterjee , Raimundo Saona , Jakub Svoboda

We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with $\omega$-regular objectives. While the existence of an equilibrium whose payoff falls into a certain interval may be undecidable, we…

Computer Science and Game Theory · Computer Science 2010-06-24 Michael Ummels , Dominik Wojtczak

The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within $\epsilon$ in time exponential in a polynomial in the size of the game times polynomial in logarithmic in…

Computer Science and Game Theory · Computer Science 2008-12-18 Krishnendu Chatterjee , Rupak Majumdar , Thomas A. Henzinger

We study the computational complexity of finding stable outcomes in hedonic games, which are a class of coalition formation games. We restrict our attention to symmetric additively-separable hedonic games, which are a nontrivial subclass of…

Computer Science and Game Theory · Computer Science 2015-09-18 Martin Gairing , Rahul Savani

This paper deals with a standard stochastic game model with a continuum of states under the duel-type setup. It newly proposes a hybrid model of game theory and the fluctuation process, which could be applied for various practical decision…

Optimization and Control · Mathematics 2020-08-10 Song-Kyoo Kim

Stochastic games are fundamental in various applications, including the control of cyber-physical systems (CPS), where both controller and environment are modeled as players. Traditional algorithms typically aim to determine a single…

Systems and Control · Electrical Eng. & Systems 2025-10-17 Kittiphon Phalakarn , Sasinee Pruekprasert , Ichiro Hasuo

We study 2-player turn-based perfect-information stochastic games with countably infinite state space. The players aim at maximizing/minimizing the probability of a given event (i.e., measurable set of infinite plays), such as reachability,…

Computer Science and Game Theory · Computer Science 2017-04-18 Stefan Kiefer , Richard Mayr , Mahsa Shirmohammadi , Dominik Wojtczak

A cellular game is a dynamical system in which cells, placed in some discrete structure, are regarded as playing a game with their immediate neighbors. Individual strategies may be either deterministic or stochastic. Strategy success is…

adap-org · Physics 2008-02-03 Lenore Levine

We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm…

Computer Science and Game Theory · Computer Science 2011-06-21 Haris Aziz , Bart de Keijzer

Stochastic two-player games model systems with an environment that is both adversarial and stochastic. The adversarial part of the environment is modeled by a player (Player 2) who tries to prevent the system (Player 1) from achieving its…

Computer Science and Game Theory · Computer Science 2025-06-11 Laurent Doyen , Pranshu Gaba , Shibashis Guha

We survey the problem of deciding the stability or stabilizability of uncertain linear systems whose region of uncertainty is a polytope. This natural setting has applications in many fields of applied science, from Control Theory to…

Systems and Control · Computer Science 2014-02-12 Nikos Vlassis , Raphaël Jungers

We propose a continuous version of the classical Gale--Berlekamp switching game. We also study a weighted version of this new continuous game. The main results of this paper concern growth estimates for the corresponding optimization…

Combinatorics · Mathematics 2020-03-16 Daniel Pellegrino , Janiely Silva , Eduardo V. Teixeira

Game theory is the standard tool used to model strategic interactions in evolutionary biology and social science. Traditional game theory studies the equilibria of simple games. But is traditional game theory applicable if the game is…

Chaotic Dynamics · Physics 2011-09-22 Tobias Galla , J. Doyne Farmer

In this paper we study the complexity of strategic argumentation for dialogue games. A dialogue game is a 2-player game where the parties play arguments. We show how to model dialogue games in a skeptical, non-monotonic formalism, and we…

Logic in Computer Science · Computer Science 2013-12-17 Guido Governatori , Francesco Olivieri , Simone Scannapieco , Antonino Rotolo , Matteo Cristani

This paper considers a time-varying game with $N$ players. Every time slot, players observe their own random events and then take a control action. The events and control actions affect the individual utilities earned by each player. The…

Computer Science and Game Theory · Computer Science 2014-02-04 Michael J. Neely

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the…

Logic in Computer Science · Computer Science 2016-07-11 Patricia Bouyer , Nicolas Markey , Mickael Randour , Kim G. Larsen , Simon Laursen
‹ Prev 1 8 9 10 Next ›