---
res:
  bibo_abstract:
  - Network games (NGs) are played on directed graphs and are extensively used in
    network design and analysis. Search problems for NGs include finding special strategy
    profiles such as a Nash equilibrium and a globally-optimal solution. The networks
    modeled by NGs may be huge. In formal verification, abstraction has proven to
    be an extremely effective technique for reasoning about systems with big and even
    infinite state spaces. We describe an abstraction-refinement methodology for reasoning
    about NGs. Our methodology is based on an abstraction function that maps the state
    space of an NG to a much smaller state space. We search for a global optimum and
    a Nash equilibrium by reasoning on an under- and an over-approximation defined
    on top of this smaller state space. When the approximations are too coarse to
    find such profiles, we refine the abstraction function. We extend the abstraction-refinement
    methodology to labeled networks, where the objectives of the players are regular
    languages. Our experimental results demonstrate the effectiveness of the methodology.
    @eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Guy
      foaf_name: Avni, Guy
      foaf_surname: Avni
      foaf_workInfoHomepage: http://www.librecat.org/personId=463C8BC2-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0001-5588-8287
  - foaf_Person:
      foaf_givenName: Shibashis
      foaf_name: Guha, Shibashis
      foaf_surname: Guha
  - foaf_Person:
      foaf_givenName: Orna
      foaf_name: Kupferman, Orna
      foaf_surname: Kupferman
  bibo_doi: 10.3390/g9030039
  bibo_issue: '3'
  bibo_volume: 9
  dct_date: 2018^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/2073-4336
  dct_language: eng
  dct_publisher: MDPI@
  dct_title: An abstraction-refinement methodology for reasoning about network games@
...