Equilibrium flows and path dilation for a network forwarding game

We consider a forwarding game on directed graphs where selfish nodes need to send certain amount of flow (packets) to specific destinations, possibly through several relay nodes. Each node has to decide whether to pay the cost of relaying flow as an intermediate node, given the fact that its neighbors can punish it for its non-cooperation. In this work we simplify the original network model, and provide the first experimental evaluation of …