A decentralized, private-information PAC-learning algorithm exists for reachability in turn-based stochastic games whenever the expected conditional distance to the target is bounded.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
PAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional Distance
A decentralized, private-information PAC-learning algorithm exists for reachability in turn-based stochastic games whenever the expected conditional distance to the target is bounded.