From the 1 of 4 linked papers with an AI index.
4 papers
PAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional Distance
Ali Asadi, Krishnendu Chatterjee, Pavol Kebis
The paper studies PAC learning for reachability objectives in turn‑based stochastic games, proposing a decentralized approach where each player learns privately without sharing alg…
Generalized Bidding Games: Where Bidding and Stochastic Games Meet
Ali Asadi, Thomas A. Henzinger, Ehsan Kafshdar Goharshady +2
Two-player games on graphs are a classical framework for analyzing strategic decision making. In turn-based games, two players move a token along the edges of the graph, and the ri…
Quantitative Language Automata
Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi +1
A quantitative word automaton (QWA) defines a function from infinite words to values. For example, every infinite run of a limit-average QWA A obtains a mean payoff, and every word…
Transcendence for Pisot Morphic Words over an Algebraic Base
Pavol Kebis, Florian Luca, Joel Ouaknine +2
It is known that for a uniform morphic sequence and an algebraic number such that , the number $[\![\boldsymbol{u} ]\…