Optimal paths in network games with \(p\) players (Q1962055): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An algorithm and a program for finding the minimax path tree in weighted digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4083324 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4695280 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the minimax path in a network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Non-cooperative games / rank | |||
Normal rank | |||
Latest revision as of 11:29, 29 May 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
0 references
