Finding Stable flows in multi-agent Networks under an equal-sharing policy - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Finding Stable flows in multi-agent Networks under an equal-sharing policy

Abstract

A Multi-Agent network flow problem is addressed in this paper where a set of transportation-agents can control the capacities of a set of routes. Each agent incurs a cost proportional to the chosen capacity. A third-party agent, a customer, is interesting in maximizing the product flow transshipped from a source to a sink node through the network. He offers a reward proportional to the flow value, which is shared equally among the transportation-agents. We address the problem of finding a stable strategy (i.e., a Nash Equilibrium) which maximizes the network flow. We show that this problem, already proved to be NP-hard, can be modeled and solved using mixed integer linear programming (MILP).
Fichier principal
Vignette du fichier
paper-inoc2015-hal.pdf (121.23 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01152083 , version 1 (14-05-2015)
hal-01152083 , version 2 (21-06-2015)

Identifiers

  • HAL Id : hal-01152083 , version 2

Cite

Nadia Chaabane, Cyril Briand, Marie-José Huguet. Finding Stable flows in multi-agent Networks under an equal-sharing policy. International Network Optimization Conference (INOC), May 2015, Warsaw, Poland. pp.157-164. ⟨hal-01152083v2⟩
215 View
188 Download

Share

Gmail Mastodon Facebook X LinkedIn More