Nash Equilibrium for Upward-Closed Objectives

DOI10.1007/11874683_18MaRDI QIDQ3613343zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Noncooperative games (91A10) Stochastic games, stochastic differential games (91A15) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• Computer Science Logic
• CONCUR 2005 – Concurrency Theory
• The complexity of Nash equilibria in stochastic multiplayer games
• Nash equilibria in concurrent games with Büchi objectives
• Decision Problems for Nash Equilibria in Stochastic Games

Cited in

(16)

• An abstraction-refinement methodology for reasoning about network games
• Timed network games
• Infinite-duration poorman-bidding games
• Dynamic resource allocation games
• Nash equilibria in concurrent games with Büchi objectives
• Hierarchical network formation games
• Network-formation games with regular objectives
• Multiplayer cost games with simple Nash equilibria
• Timed network games with clocks
• Stochastic equilibria under imprecise deviations in terminal-reward concurrent games
• Timed network games
• Computer Science Logic
• scientific article; zbMATH DE number 7327943 (Why is no real title available?)
• Determinacy in discrete-bidding infinite-duration games
• CONCUR 2005 – Concurrency Theory
• Equilibria-based probabilistic model checking for concurrent stochastic games

This page was built for publication: Nash Equilibrium for Upward-Closed Objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613343)