Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies (Q6581883)
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: Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies |
scientific article; zbMATH DE number 7890772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies |
scientific article; zbMATH DE number 7890772 |
Statements
Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies (English)
0 references
1 August 2024
0 references
Nash equilibrium
0 references
\(n\)-person deterministic graphical games
0 references
shortest path games
0 references
terminal games
0 references
0 references
0 references
0.8343955278396606
0 references
0.8210965394973755
0 references
0.8061374425888062
0 references
0.7991576790809631
0 references
