A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (Q747538)
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: A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria |
scientific article; zbMATH DE number 6495516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria |
scientific article; zbMATH DE number 6495516 |
Statements
A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (English)
0 references
16 October 2015
0 references
shortest path
0 references
Bellman-Ford
0 references
Nash equilibrium
0 references
binary decision diagram (BDD)
0 references
model checking
0 references
0 references
0 references
0 references
0 references
0.8001245856285095
0 references
0.7983470559120178
0 references
0.788091778755188
0 references
