12 citations · 19 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.GT2019
Flow Allocation Games
Nils Bertschinger, Martin Hoefer, Daniel Schmand
We study a game-theoretic variant of the maximum circulation problem. In a flow allocation game, we are given a directed flow network. Each node is a rational agent and can strateg…
cs.GT2019
Network Investment Game with Wardrop Followers
Daniel Schmand, Marc Schröder, Alexander Skopalik
We study a two-sided network investment game consisting of two sets of players, called providers and users. The game is set in two stages. In the first stage, providers aim to maxi…