Optimal paths in network games with \(p\) players (Q1962055)
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 1395022
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal paths in network games with \(p\) players |
scientific article; zbMATH DE number 1395022 |
Statements
Optimal paths in network games with \(p\) players (English)
0 references
30 January 2000
0 references
The authors develop optimal paths in networks which generalize the well known combinatorial problem on the shortest path in a network. The problem formulation and the theorems are presented without numerical illustration.
0 references
optimal paths in networks
0 references
0 references
0.885086715221405
0 references
0.7942640781402588
0 references
0.7688456773757935
0 references
0.7674662470817566
0 references
