<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>An abstraction-refinement methodology for reasoning about network games</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Guy</namePart>
  <namePart type="family">Avni</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">463C8BC2-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0001-5588-8287</description></name>
<name type="personal">
  <namePart type="given">Shibashis</namePart>
  <namePart type="family">Guha</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Orna</namePart>
  <namePart type="family">Kupferman</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">ToHe</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>





<name type="corporate">
  <namePart>Formal Methods meets Algorithmic Game Theory</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>Rigorous Systems Engineering</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>Formal methods for the design and analysis of complex systems</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">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. </abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2018_MDPI_Avni.pdf">https://research-explorer.ista.ac.at/download/6006/6008/2018_MDPI_Avni.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem><accessCondition type="use and reproduction">https://creativecommons.org/licenses/by/4.0/</accessCondition>
<originInfo><publisher>MDPI</publisher><dateIssued encoding="w3cdtf">2018</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Games</title></titleInfo>
  <identifier type="issn">2073-4336</identifier><identifier type="doi">10.3390/g9030039</identifier>
<part><detail type="volume"><number>9</number></detail><detail type="issue"><number>3</number></detail>
</part>
</relatedItem>
<relatedItem type="Supplementary material">
  <location>     <url>https://research-explorer.ista.ac.at/record/1003</url>  </location>
</relatedItem>

<extension>
<bibliographicCitation>
<short>G. Avni, S. Guha, O. Kupferman, Games 9 (2018).</short>
<ista>Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for reasoning about network games. Games. 9(3), 39.</ista>
<ieee>G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” &lt;i&gt;Games&lt;/i&gt;, vol. 9, no. 3. MDPI, 2018.</ieee>
<mla>Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” &lt;i&gt;Games&lt;/i&gt;, vol. 9, no. 3, 39, MDPI, 2018, doi:&lt;a href=&quot;https://doi.org/10.3390/g9030039&quot;&gt;10.3390/g9030039&lt;/a&gt;.</mla>
<apa>Avni, G., Guha, S., &amp;#38; Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. &lt;i&gt;Games&lt;/i&gt;. MDPI. &lt;a href=&quot;https://doi.org/10.3390/g9030039&quot;&gt;https://doi.org/10.3390/g9030039&lt;/a&gt;</apa>
<chicago>Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” &lt;i&gt;Games&lt;/i&gt;. MDPI, 2018. &lt;a href=&quot;https://doi.org/10.3390/g9030039&quot;&gt;https://doi.org/10.3390/g9030039&lt;/a&gt;.</chicago>
<ama>Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. &lt;i&gt;Games&lt;/i&gt;. 2018;9(3). doi:&lt;a href=&quot;https://doi.org/10.3390/g9030039&quot;&gt;10.3390/g9030039&lt;/a&gt;</ama>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>6006</recordIdentifier><recordCreationDate encoding="w3cdtf">2019-02-14T14:17:54Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-07-10T11:49:38Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
