Results 1 to 10 of about 168,743 (170)
Blackwell-Optimal Strategies in Priority Mean-Payoff Games [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We examine perfect information stochastic mean-payoff games - a class of games containing as special sub-classes the usual mean-payoff games and parity games.
Hugo Gimbert, Wiesław Zielonka
doaj +8 more sources
Tree games with regular objectives [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study tree games developed recently by Matteo Mio as a game interpretation of the probabilistic μ-calculus. With expressive power comes complexity.
Marcin Przybyłko
doaj +5 more sources
Obligation Blackwell Games and p-Automata [PDF]
The Journal of Symbolic Logic, 2013 We recently introduced p-automata, automata that read discrete-time Markov chains. We used turn-based stochastic parity games to define acceptance of Markov chains by a subclass of p-automata.
Chatterjee, Krishnendu, Piterman, Nir
core +5 more sources
, 1996 Blackwell games are infinite games of imperfect information. The two players simultaneously make their moves, and are then informed of each other's moves.
Vervoort, Marco R.
core +5 more sources
A Survey on Entropy and Economic Behaviour [PDF]
Entropy, 2020 Entropy plays a significant role in the study of games and economic behaviour in several ways. A decision maker faced with an n-fold repetition of a decision-making problem needs to apply strategies that become increasingly complex as n increases.
Ziv Hellman, Ron Peretz
doaj +2 more sources
Comparison of Information Structures for Zero-Sum Games and a Partial Converse to Blackwell Ordering in Standard Borel Spaces [PDF]
SIAM Journal on Control and Optimization, 2021 In statistical decision theory involving a single decision-maker, an information structure is said to be better than another one if for any cost function involving a hidden state variable and an action variable which is restricted to be conditionally independent from the state given some measurement, the solution value under the former is not worse ...
Ian Hogeboom-Burr, Serdar Yüksel
openaire +5 more sources
Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted game [PDF]
, 2007 International audienceWe define and examine priority mean-payoff games - a natural extension of parity games. By adapting the notion of Blackwell optimality borrowed from the theory of Markov decision processes we show that priority mean-payoff games can
Gimbert, Hugo, Zielonka, Wieslaw
core +4 more sources
, 2022 It was shown in Flesch and Solan (2022) with a rather involved proof that all two-player stochastic games with finite state and action spaces and shift-invariant payoffs admit an $ε$-equilibrium, for every $ε>0$. Their proof also holds for two-player absorbing games with tail-measurable payoffs.
Ashkenazi-Golan, Galit +2 more
openaire +2 more sources
Introduction to Learning in Games: A Symposium in Honor of David Blackwell [PDF]
, 1999 David K Levine +2 more
core +1 more source
Time-Dependent Blackwell Approachability and Application to Absorbing Games
, 2023 Blackwell's approachability (Blackwell, 1954, 1956) is a very general online learning framework where a Decision Maker obtains vector-valued outcomes, and aims at the convergence of the average outcome to a given ``target'' set. Blackwell gave a sufficient condition for the decision maker having a strategy guaranteeing such a convergence against an ...
Kwon, Joon, Wan, Yijun, Ziliotto, Bruno
openaire +2 more sources