Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Liminf payoff"'
Autor:
Flesch, János1 (AUTHOR) j.flesch@maastrichtuniversity.nl, Predtetchinski, Arkadi2 (AUTHOR), Sudderth, William3 (AUTHOR)
Publikováno v:
International Journal of Game Theory. Jun2021, Vol. 50 Issue 2, p559-579. 21p.
Publikováno v:
International Journal of Game Theory, 50(2), 559-579. Springer
Dubins and Savage (How to gamble if you must: inequalities for stochastic processes, McGraw-Hill, New York, 1965) found an optimal strategy for limsup gambling problems in which a player has at most two choices at every state x at most one of which c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a457ca4f924d6c4b6171d0fd1e24828d
https://doi.org/10.1007/s00182-021-00762-4
https://doi.org/10.1007/s00182-021-00762-4
Autor:
Gimbert, Hugo1 (AUTHOR), Kelmendi, Edon2 (AUTHOR) e.kelmendi@qmul.ac.uk
Publikováno v:
International Journal of Game Theory. Dec2023, Vol. 52 Issue 4, p1179-1214. 36p.
Autor:
Mayr, Richard, Munday, Eric
We study Markov decision processes (MDPs) with a countably infinite number of states. The $\limsup$ (resp. $\liminf$) threshold objective is to maximize the probability that the $\limsup$ (resp. $\liminf$) of the infinite sequence of directly seen re
Externí odkaz:
http://arxiv.org/abs/2211.13259
Autor:
Gawlitza, Thomas Martin, Seidl, Helmut
Publikováno v:
Computer Aided Verification (9783642026577); 2009, p291-305, 15p
Publikováno v:
Discrete Applied Mathematics. Dec2018, Vol. 251, p40-56. 17p.
Autor:
Mayr, Richard, Munday, Eric
We study countably infinite Markov decision processes (MDPs) with transition rewards. The $\limsup$ (resp. $\liminf$) threshold objective is to maximize the probability that the $\limsup$ (resp. $\liminf$) of the infinite sequence of transition rewar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6707434eb2c75a63f38a9e660ab405e
http://arxiv.org/abs/2211.13259
http://arxiv.org/abs/2211.13259
Publikováno v:
Journal of Applied Probability; Sep2018, Vol. 55 Issue 3, p728-741, 14p
Autor:
Sudderth, William D.1
Publikováno v:
Mathematics of Operations Research. May83, Vol. 8 Issue 2, p287-297. 11p.
Autor:
Thomas Martin Gawlitza, Helmut Seidl
Publikováno v:
Computer Aided Verification ISBN: 9783642026577
CAV
CAV
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consider total-payoff games which have been introduced as a refinement of me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f6533ed8915902bda48b23eeb7012f8
https://doi.org/10.1007/978-3-642-02658-4_24
https://doi.org/10.1007/978-3-642-02658-4_24