scientific article; zbMATH DE number 6774221

DOI10.4230/LIPIcs.CONCUR.2015.325zbMath1374.68317MaRDI QIDQ5357713

Guy Avni, Orna Kupferman, Shaull Almagor

Publication date: 12 September 2017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Nash equilibriumrepairconcurrent games

Mathematics Subject Classification ID

Applications of game theory (91A80) (n)-person games, (n>2) (91A06) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (13)

An abstraction-refinement methodology for reasoning about network games ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ Unnamed Item ⋮ Infinite-duration poorman-bidding games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hierarchical Network Formation Games ⋮ Dynamic resource allocation games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Infinite-Duration Bidding Games ⋮ Timed network games

This page was built for publication: