12 citations · 19 across the 9 of their papers we have counts for
5 papers · 1 filter
On the Price of Anarchy in Packet Routing Games with FIFO
Daniel Schmand, Torben Schürenberg, Martin Strehler
We investigate packet routing games in which network users selfishly route themselves through a network over discrete time, aiming to reach the destination as quickly as possible.…
Bicriteria Nash Flows over Time
Tim Oosterwijk, Daniel Schmand, Marc Schröder
Flows over time are a natural way to incorporate flow dynamics that arise in various applications such as traffic networks. In this paper we introduce a natural variant of the dete…
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…
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…
Sharing Non-Anonymous Costs of Multiple Resources Optimally
Max Klimm, Daniel Schmand
In cost sharing games, the existence and efficiency of pure Nash equilibria fundamentally depends on the method that is used to share the resources' costs. We consider a general cl…