Games with secure equilibria (Q854165)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Games with secure equilibria |
scientific article; zbMATH DE number 5079005
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Games with secure equilibria |
scientific article; zbMATH DE number 5079005 |
Statements
Games with secure equilibria (English)
0 references
7 December 2006
0 references
The authors define the notion of a secure equilibrium, prove the existence and uniqueness of maximal secure equilibria in graph games with Borel objectives, charaterize the memory requirements of strategies that achieve the equilibrium, and show that there can be multiple maximal secure equilibria in 3-player graph games with reachability objectives.
0 references
Game theory
0 references
Nash equilibria
0 references
\(\Omega\)-regular games
0 references
component-based verification
0 references
