Reachability Games

Reachability Games is a subclass of stochastic games in which the primary objective is to reach a designated set of target states, distinguishing it from other stochastic games by focusing on qualitative reachability goals rather than quantitative payoff maximization.

58

Publications

1.6K

Citations

110

Authors

64

Institutions

Publications per year

2017–2026

13

Authors

110

  1. KC
    Krishnendu Chatterjee

    Institute of Science and Technology Austria, Austria

    10 publications · 330 citations

    9

    h-index

  2. LD
    Luca de Alfaro

    University of California, Santa Cruz, United States

    8 publications · 396 citations

    8

    h-index

  3. TA
    Thomas A. Henzinger

    University of California, Berkeley, United States

    7 publications · 419 citations

    7

    h-index

  4. TB
    Thomas Brihaye

    University of Mons, Belgium

    5 publications · 83 citations

    5

    h-index

  5. HG
    Hugo Gimbert

    Laboratoire Bordelais de Recherche en Informatique, France

    4 publications · 93 citations

    4

    h-index

1–5 of 110

Venues

  1. Information and Computation

    5 publications · 106 citations

    5

    h-index

  2. arXiv (Cornell University)

    Repository · 4 publications · 60 citations

    4

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 3 publications · 54 citations

    3

    h-index

  4. Logical Methods in Computer Science

    LMCS · 3 publications · 59 citations

    3

    h-index

  5. 2

    h-index

1–5