Nash Equilibria for multi-agent network flow with controllable capacities - Archive ouverte HAL Access content directly
Journal Articles Communications in Computer and Information Science Year : 2015

Nash Equilibria for multi-agent network flow with controllable capacities

Abstract

In this work, a multi-agent network flow problem is addressed where a set of transportation-agents can control the capacities of a set of elementary routes A third-party agent, a customer, is interesting in maximizing the product flow transshipped from a source to a sink node through the network and offers a reward that is proportional to the flow value the transportation agents manage to provide. This problem can be viewed as a Multi-Agent Minimum-Cost Maximum-Flow Problem where the focus is put on finding stable strategies (i.e., Nash Equilibria) such that no transportation-agent has any incentive to modify its behavior. We show how such an equilibrium can be characterized by means of augmenting or decreasing paths in a reduced network. We also discuss the problem of finding a Nash Equilibrium that maximizes the flow and prove its NP-Hardness.
Fichier principal
Vignette du fichier
paper-LNCS-CCIS-hal.pdf (415.18 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01166010 , version 1 (21-06-2015)

Identifiers

Cite

Nadia Chaabane, Cyril Briand, Marie-José Huguet. Nash Equilibria for multi-agent network flow with controllable capacities. Communications in Computer and Information Science, 2015, Operations Research and Enterprise Systems, 509, pp.47-62. ⟨10.1007/978-3-319-17509-6_4⟩. ⟨hal-01166010⟩
164 View
216 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More