An Abstraction-Refinement Methodologyfor Reasoning about Network Games†
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, ab...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-06-01
|
| Series: | Games |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-4336/9/3/39 |