---
res:
  bibo_abstract:
  - "We study concurrent graph games where n players cooperate against an opponent
    to reach a set of target states. Unlike traditional settings, we study distributed
    randomisation: team players do not share a source of randomness, and their private
    random sources are hidden from the opponent and from each other.\r\n\r\nWe show
    that memoryless strategies are sufficient for the threshold problem (deciding
    whether there is a strategy for the team that ensures winning with probability
    that exceeds a threshold), a result that not only places the problem in the Existential
    Theory of the Reals (ER) but also enables the construction of value iteration
    algorithms. We additionally show that the threshold problem is NP-hard. For the
    almost-sure reachability problem, we prove NP-completeness.\r\n\r\nWe introduce
    Individually Randomised Alternating-time Temporal Logic (IRATL). This logic extends
    the standard ATL framework to reason about probability thresholds, with semantics
    explicitly designed for coalitions that lack a shared source of randomness. On
    the practical side, we implement and evaluate a solver for the threshold and almost-sure
    problem based on the algorithms that we develop.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Leonard J
      foaf_name: Brice, Leonard J
      foaf_surname: Brice
      foaf_workInfoHomepage: http://www.librecat.org/personId=ce3b3409-db6c-11f0-aa64-ad678f7fd937
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-2985-7724
  - foaf_Person:
      foaf_givenName: Alipasha
      foaf_name: Montaseri, Alipasha
      foaf_surname: Montaseri
      foaf_workInfoHomepage: http://www.librecat.org/personId=709a7f96-8896-11f0-9809-d75612fc0f2e
  - foaf_Person:
      foaf_givenName: Ali
      foaf_name: Shafiee, Ali
      foaf_surname: Shafiee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2783031a-7378-11f0-b2d0-f17f1db2ebad
  - foaf_Person:
      foaf_givenName: K. S.
      foaf_name: Thejaswini, K. S.
      foaf_surname: Thejaswini
  bibo_doi: 10.1007/978-3-032-32519-8_12
  bibo_volume: 16682
  dct_date: 2026^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0302-9743
  - http://id.crossref.org/issn/1611-3349
  - http://id.crossref.org/issn/9783032325181
  dct_language: eng
  dct_publisher: Springer Nature@
  dct_title: Randomise alone, reach as a team@
...