Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game (Q4565775)
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: Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game |
scientific article; zbMATH DE number 6887373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game |
scientific article; zbMATH DE number 6887373 |
Statements
Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game (English)
0 references
13 June 2018
0 references
multiagent network flow
0 references
Nash equilibria
0 references
complexity
0 references
network expansion game
0 references
mixed integer linear programming
0 references
0.8879236
0 references
0.8873815
0 references
0.8799231
0 references
0 references
0.87801325
0 references
0.87433237
0 references
0.87312734
0 references
0.8712958
0 references
0.8682585
0 references
