Nash Equilibrium for Upward-Closed Objectives
From MaRDI portal
Publication:3613343
DOI10.1007/11874683_18zbMath1225.91009OpenAlexW2120326455MaRDI QIDQ3613343
Publication date: 12 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11874683_18
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Games involving graphs (91A43) Applications of game theory (91A80) Stochastic games, stochastic differential games (91A15) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (10)
An abstraction-refinement methodology for reasoning about network games ⋮ Network-formation games with regular objectives ⋮ Unnamed Item ⋮ Infinite-duration poorman-bidding games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hierarchical Network Formation Games ⋮ Dynamic resource allocation games ⋮ Unnamed Item ⋮ Timed network games
This page was built for publication: Nash Equilibrium for Upward-Closed Objectives
