Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/219173
Authors: 
Avni, Guy
Guha, Shibashis
Kupferman, Orna
Year of Publication: 
2018
Citation: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 9 [Year:] 2018 [Issue:] 3 [Pages:] 1-21
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.
Subjects: 
network formation games
abstraction-refinement
Nash equilibrium
social optimum
Persistent Identifier of the first edition: 
Creative Commons License: 
https://creativecommons.org/licenses/by/4.0/
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.