A Multi-Agent Min-Cost Flow problem with Controllable Capacities - Complexity of Finding a Maximum-flow Nash Equilibrium.
Nadia Chaabane FakhfakhCyril BriandMarie-José HuguetPublished in: ICORES (2014)
Keyphrases
- min cost
- nash equilibrium
- maximum flow
- flow network
- multi agent
- max flow
- network flow
- worst case
- game theory
- combinatorial optimization problems
- approximation algorithms
- nash equilibria
- directed graph
- parallel processors
- resource allocation
- multi agent systems
- cooperative
- reinforcement learning
- computational complexity
- optimal solution
- coalition formation
- minimum cost
- integer programming