Deterministic graphical games (Q2277168)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4195756
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic graphical games |
scientific article; zbMATH DE number 4195756 |
Statements
Deterministic graphical games (English)
0 references
1990
0 references
The author studies antagonistic games of perfect information played on finite directed graphs. The possibility of infinite play is not excluded. An efficient algorithm for calculating an equilibrium point of the game is presented and analyzed. Similar games, even on not necessarily finite graphs, have been studied in detail, but not from the computational point of view, by \textit{B. Kummer} [``Spiele auf Graphen'' (1980; Zbl 0486.90086)].
0 references
calculation of equilibria
0 references
perfect information
0 references
finite directed graphs
0 references
0.8630881905555725
0 references
0.8468976616859436
0 references
0.8205178380012512
0 references
0.801426112651825
0 references
