mlsanityData to 14 Oct 2026

Strategic Coalitions in Stochastic Games

arXiv 1910.04489 ↗First posted 10 Oct 2019cs.AI cs.GT cs.LOcited by 1

Not on the map. Why?

Abstract (arXiv)

The article introduces a notion of a stochastic game with failure states and proposes two logical systems with modality "coalition has a strategy to transition to a non-failure state with a given probability while achieving a given goal." The logical properties of this modality depend on whether the modal language allows the empty coalition. The main technical results are a completeness theorem for a logical system with the empty coalition, a strong completeness theorem for the logical system without the empty coalition, and an incompleteness theorem which shows that there is no strongly complete logical system in the language with the empty coalition.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 10 Oct 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.