Finding stable flows in multi-agent networks under an equal-sharing policy - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

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

Résumé

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) that maximizes the network flow. In this paper, we present a Mixed Integer Linear Program (MILP) to model and solve this problem.
Fichier principal
Vignette du fichier
paper.pdf (334.2 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Identifiants

  • HAL Id : hal-01152083 , version 1

Citer

Nadia Fakhfakh Chaabane, Cyril Briand, Marie-José Huguet. Finding stable flows in multi-agent networks under an equal-sharing policy. International Network Optimization Conference, May 2015, Warsaw, Poland. ⟨hal-01152083v1⟩
217 Consultations
188 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More