Optimal paths in network games with \(p\) players (Q1962055): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Dmitrii D. Lozovanu / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Prabhat Kumar Mahanti / rank | |||
Normal rank | |||
Revision as of 05:44, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal paths in network games with \(p\) players |
scientific article |
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
