On Subgame Perfection in Quantitative Reachability Games

@article{Brihaye2012OnSP,
  title={On Subgame Perfection in Quantitative Reachability Games},
  author={Thomas Brihaye and V{\'e}ronique Bruy{\`e}re and Julie De Pril and Hugo Gimbert},
  journal={Logical Methods in Computer Science},
  year={2012},
  volume={9}
}
  • Thomas Brihaye, Véronique Bruyère, +1 author Hugo Gimbert
  • Published in
    Logical Methods in Computer…
    2012
  • Mathematics, Computer Science
  • We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria in the multiplayer case remained and is still an open problem. In this paper, we focus our study on… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 18 CITATIONS

    On Relevant Equilibria in Reachability Games

    VIEW 4 EXCERPTS
    CITES BACKGROUND

    Infinite-duration Bidding Games

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Infinite-Duration Poorman-Bidding Games

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Hierarchical Network Formation Games

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 33 REFERENCES