Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game

DOI10.1002/net.21711zbMath1390.90099MaRDI QIDQ4565775

Marie-José Huguet, Nadia Chaabane, Cyril Briand, Alessandro Agnetis

Publication date: 13 June 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21711

zbMATH Keywords

complexity; Nash equilibria; mixed integer linear programming; multiagent network flow; network expansion game

Mathematics Subject Classification ID

90C11: Mixed integer programming

91A10: Noncooperative games

90C05: Linear programming

90B10: Deterministic network models in operations research