Results 1 to 10 of about 28,094 (268)
Subgame-perfect Equilibria in Mean-payoff Games (journal version) [PDF]
Logical Methods in Computer Science, 2023 In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives.
Léonard Brice +2 more
doaj +1 more source
Continuous Positional Payoffs [PDF]
Logical Methods in Computer Science, 2023 What payoffs are positionally determined for deterministic two-player antagonistic games on finite directed graphs? In this paper we study this question for payoffs that are continuous.
Alexander Kozachinskiy
doaj +1 more source
A Recursive Approach to Solving Parity Games in Quasipolynomial Time [PDF]
Logical Methods in Computer Science, 2022 Zielonka's classic recursive algorithm for solving parity games is perhaps the simplest among the many existing parity game algorithms. However, its complexity is exponential, while currently the state-of-the-art algorithms have quasipolynomial ...
Karoliina Lehtinen +3 more
doaj +1 more source
The Theory of Universal Graphs for Infinite Duration Games [PDF]
Logical Methods in Computer Science, 2022 We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff games.
Thomas Colcombet +3 more
doaj +1 more source
One-Clock Priced Timed Games with Negative Weights [PDF]
Logical Methods in Computer Science, 2022 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).
Thomas Brihaye +4 more
doaj +1 more source
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs [PDF]
TheoretiCS, 2023 We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive systems.
Pierre Ohlmann
doaj +1 more source
Determinacy in Discrete-Bidding Infinite-Duration Games [PDF]
Logical Methods in Computer Science, 2021 In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and ...
Milad Aghajohari +2 more
doaj +1 more source
Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width [PDF]
Logical Methods in Computer Science, 2013 Parity games are a much researched class of games in NP intersect CoNP that are not known to be in P. Consequently, researchers have considered specialised algorithms for the case where certain graph parameters are small.
John Fearnley, Sven Schewe
doaj +1 more source
Markov Decision Processes with Multiple Long-run Average Objectives [PDF]
Logical Methods in Computer Science, 2014 We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives.
Tomáš Brázdil +4 more
doaj +1 more source
Reachability Switching Games [PDF]
Logical Methods in Computer Science, 2021 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.
John Fearnley +3 more
doaj +1 more source