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

DOI10.1002/NET.21711zbMATH Open1390.90099OpenAlexW2531572831MaRDI QIDQ4565775FDOQ4565775

Authors: Nadia Chaabane, Cyril Briand, Marie-José Huguet, 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

Recommendations

• Distributed Nash equilibrium seeking in networked graphical games
• An algorithm for finding Nash equilibria in dynamic network games
• Approximative Nash-equilibria in network games
• A game-theoretic approach to network equilibrium
• Nash equilibrium seeking of general linear multi-agent systems in the cooperation-competition network
• Distributed Generalized Nash Equilibrium Seeking in Aggregative Games on Time-Varying Networks
• A non-cooperative game theory approach to cost sharing in networks
• Finding stable flows in multi-agent networks under an equal-sharing policy
• On cost sharing mechanisms in the network design game

zbMATH Keywords

complexitymixed integer linear programmingNash equilibriamultiagent network flownetwork expansion game

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10) Noncooperative games (91A10) Mixed integer programming (90C11)

Cited In (2)

• How egalitarian are Nash equilibria in network cost-sharing games?
• Finding stable flows in multi-agent networks under an equal-sharing policy

This page was built for publication: Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565775)