---
res:
  bibo_abstract:
  - 'Graph games of infinite length provide a natural model for open reactive systems:
    one player (Eve) represents the controller and the other player (Adam) represents
    the environment. The evolution of the system depends on the decisions of both
    players. The specification for the system is usually given as an ω-regular language
    L over paths and Eve’s goal is to ensure that the play belongs to L irrespective
    of Adam’s behaviour. The classical notion of winning strategies fails to capture
    several interesting scenarios. For example, strong fairness (Streett) conditions
    are specified by a number of request-grant pairs and require every pair that is
    requested infinitely often to be granted infinitely often: Eve might win just
    by preventing Adam from making any new request, but a “better” strategy would
    allow Adam to make as many requests as possible and still ensure fairness. To
    address such questions, we introduce the notion of obliging games, where Eve has
    to ensure a strong condition Φ, while always allowing Adam to satisfy a weak condition
    Ψ. We present a linear time reduction of obliging games with two Muller conditions
    Φ and Ψ to classical Muller games. We consider obliging Streett games and show
    they are co-NP complete, and show a natural quantitative optimisation problem
    for obliging Streett games is in FNP. We also show how obliging games can provide
    new and interesting semantics for multi-player games.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Krishnendu
      foaf_name: Chatterjee, Krishnendu
      foaf_surname: Chatterjee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4561-241X
  - foaf_Person:
      foaf_givenName: Florian
      foaf_name: Horn, Florian
      foaf_surname: Horn
      foaf_workInfoHomepage: http://www.librecat.org/personId=37327ACE-F248-11E8-B48F-1D18A9856A87
  - foaf_Person:
      foaf_givenName: Christof
      foaf_name: Löding, Christof
      foaf_surname: Löding
  bibo_doi: 10.1007/978-3-642-15375-4_20
  bibo_volume: 6269
  dct_date: 2010^xs_gYear
  dct_language: eng
  dct_publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik@
  dct_title: Obliging games@
...