Games with secure equilibria (Q854165)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Games with secure equilibria |
scientific article |
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
