An abstraction-refinement methodology for reasoning about network games
From MaRDI portal
Publication:1630443
DOI10.3390/g9030039zbMath1418.91097OpenAlexW2740294674WikidataQ125839905 ScholiaQ125839905MaRDI QIDQ1630443
Orna Kupferman, Shibashis Guha, Guy Avni
Publication date: 10 December 2018
Published in: Games (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/g9030039
Games involving graphs (91A43) Formal languages and automata (68Q45) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (5)
Unnamed Item ⋮ Infinite-duration poorman-bidding games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Infinite-Duration Bidding Games
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network-formation games with regular objectives
- Worst-case equilibria
- Games with secure equilibria
- New complexity results about Nash equilibria
- Strategy logic
- How easy is local search?
- Iterated Boolean games
- A class of games possessing pure-strategy Nash equilibria
- Dynamic Resource Allocation Games
- Subgame Perfection for Equilibria in Quantitative Reachability Games
- Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
- On a network creation game
- Reasoning About Strategies
- Query Complexity of Approximate Nash Equilibria
- How bad is selfish routing?
- Hierarchical Network Formation Games
- The Price of Stability for Network Design with Fair Cost Allocation
- Counterexample-guided abstraction refinement for symbolic model checking
- Alternating-time temporal logic
- Lossless abstraction of imperfect information games
- Rational Synthesis
- The complexity of pure Nash equilibria
- On nash equilibria for a network creation game
- Nash Equilibrium for Upward-Closed Objectives
- The Structure and Function of Complex Networks
- Tools and Algorithms for the Construction and Analysis of Systems
- Computer Science Logic
- Equilibrium points in n -person games
- Algorithm for optimal winner determination in combinatorial auctions
This page was built for publication: An abstraction-refinement methodology for reasoning about network games
