12 citations · 19 across the 9 of their papers we have counts for
14 papers
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.…
Solution discovery via reconfiguration for problems in P
Mario Grobler, Stephanie Maaz, Nicole Megow +4
In the recently introduced framework of solution discovery via reconfiguration [Fellows et al., ECAI 2023], we are given an initial configuration of tokens on a graph and the q…
On Solution Discovery via Reconfiguration
Michael R. Fellows, Mario Grobler, Nicole Megow +5
The dynamics of real-world applications and systems require efficient methods for improving infeasible solutions or restoring corrupted ones by making modifications to the current…
Prophet Inequalities over Time
Andreas Abels, Elias Pitschmann, Daniel Schmand
In this paper, we introduce an over-time variant of the well-known prophet inequality with i.i.d. random variables. Instead of stopping with one realized value at some point in the…
Asynchronous Opinion Dynamics in Social Networks
Petra Berenbrink, Martin Hoefer, Dominik Kaaser +3
Opinion spreading in a society decides the fate of elections, the success of products, and the impact of political or social movements. The model by Hegselmann and Krause is a well…
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…
A Greedy Algorithm for the Social Golfer and the Oberwolfach Problem
Daniel Schmand, Marc Schröder, Laura Vargas Koch
Inspired by the increasing popularity of Swiss-system tournaments in sports, we study the problem of predetermining the number of rounds that can be guaranteed in a Swiss-system to…
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…
The Online Best Reply Algorithm for Resource Allocation Problems
Max Klimm, Daniel Schmand, Andreas Tönnis
We study the performance of a best reply algorithm for online resource allocation problems with a diseconomy of scale. In an online resource allocation problem, we are given a set…
Additive Stabilizers for Unstable Graphs
Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann +3
Stabilization of graphs has received substantial attention in recent years due to its connection to game theory. Stable graphs are exactly the graphs inducing a matching game with…
Robust Flows over Time: Models and Complexity Results
Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers +3
We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the…
Hiring Secretaries over Time: The Benefit of Concurrent Employment
Yann Disser, John Fearnley, Martin Gairing +5
We consider a stochastic online problem where applicants arrive over time, one per time step. Upon arrival of each applicant their cost per time step is revealed, and we have t…
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…