Finding stable flows in multi-agent networks under an equal-sharing policy

DOI10.1016/j.endm.2016.03.021zbMath1351.90040OpenAlexW2400990678MaRDI QIDQ325426

Cyril Briand, Marie-José Huguet, Nadia Chaabane Fakhfakh

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.021

zbMATH Keywords

Nash equilibriumequal-sharing policymulti-agent network flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Noncooperative games (91A10) Deterministic network models in operations research (90B10)

Cites Work

• Rangen: A random network generator for activity-on-the-node networks
• Supply Chain Coordination with Revenue-Sharing Contracts: Strengths and Limitations
• Multicriteria Optimization
• Equilibrium points in n -person games

This page was built for publication: Finding stable flows in multi-agent networks under an equal-sharing policy