Multi-Player Flow Games
Autonomous Agents and Multi-Agent Systems, pp. 798-820, 2018.
Game theory for practical applications Noncooperative games: computation Methodologies for agent-based systems Noncooperative games: theory and analysis
In the traditional maximum-flow problem, the goal is to transfer maximum flow in a network by directing, in each vertex in the network, incoming flow to outgoing edges. The problem corresponds to settings in which a central authority has control on all vertices of the network. Today’s computing environment, however, involves systems with ...More
Full Text (Upload PDF)
PPT (Upload PPT)