Daniel Schmand
YOU?
Author Swipe
View article: Prophet Inequalities over Time
Prophet Inequalities over Time Open
In this article, 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 process, we decide for each step how long we select the …
View article: Network Creation Games with 2-Neighborhood Maximization
Network Creation Games with 2-Neighborhood Maximization Open
Network creation games are well-established for investigating the decentralized formation of communication networks, like the Internet or social networks. In these games, selfish agents that correspond to network nodes strategically create…
View article: On the Price of Anarchy in Packet Routing Games with FIFO
On the Price of Anarchy in Packet Routing Games with FIFO Open
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. Conflicts due to limited capacities are resolved by the fir…
View article: Solution discovery via reconfiguration for problems in P
Solution discovery via reconfiguration for problems in P Open
In the recently introduced framework of solution discovery via reconfiguration [Fellows et al., ECAI 2023], we are given an initial configuration of $k$ tokens on a graph and the question is whether we can transform this configuration into…
View article: Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games Open
A decade ago, Gerhard Woeginger posed an open problem that became well-known as "Woeginger's Hiking Problem": Consider a group of $n$ people that want to go hiking; everyone expresses preferences over the size of their hiking group in the …
View article: On Solution Discovery via Reconfiguration
On Solution Discovery via Reconfiguration Open
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 state of a system in a restricted way. We propose a new fra…
View article: On Solution Discovery via Reconfiguration
On Solution Discovery via Reconfiguration Open
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 state of a system in a restricted way. We propose a new fra…
View article: Prophet Inequalities over Time
Prophet Inequalities over Time Open
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 process, we decide for each step how long we select the va…
View article: Asynchronous Opinion Dynamics in Social Networks
Asynchronous Opinion Dynamics in Social Networks Open
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-known theoretical model to study such opinion formation pr…
View article: Bicriteria Nash Flows over Time
Bicriteria Nash Flows over Time Open
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 deterministic fluid queuing model in which users aim to minimiz…
View article: Stochastic Probing with Increasing Precision
Stochastic Probing with Increasing Precision Open
We consider a selection problem with stochastic probing. There is a set of items whose values are drawn from independent distributions. The distributions are known in advance. Each item can be \emph{tested} repeatedly. Each test reduces th…
View article: Recent Developments in Mathematical Traffic Models
Recent Developments in Mathematical Traffic Models Open
Predictions such as forecasts of congestion effects in transportation networks can be based on complex simulations that include many aspects of actual transportation systems. On the other hand, rigorous mathematical traffic models give ris…
View article: Strategic Payments in Financial Networks
Strategic Payments in Financial Networks Open
In their seminal work on systemic risk in financial markets, Eisenberg and Noe [Larry Eisenberg and Thomas Noe, 2001] proposed and studied a model with n firms embedded into a network of debt relations. We analyze this model from a game-th…
View article: Hiring Secretaries over Time: The Benefit of Concurrent Employment
Hiring Secretaries over Time: The Benefit of Concurrent Employment Open
We consider a stochastic online problem where n applicants arrive over time, one per time step. Upon the arrival of each applicant, their cost per time step is revealed, and we have to fix the duration of employment, starting immediately. …
View article: Flow Allocation Games
Flow Allocation Games Open
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 strategically allocate any incoming flow to the outgoing edges. Gi…
View article: Network Investment Game with Wardrop Followers
Network Investment Game with Wardrop Followers Open
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 maximize their profit by investing in bandwidth of cloud comput…
View article: Network Investment Games with Wardrop Followers
Network Investment Games with Wardrop Followers Open
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 maximize their profit by investing in bandwidth of cloud comput…
View article: Online Best Reply Algorithms for Resource Allocation Problems.
Online Best Reply Algorithms for Resource Allocation Problems. Open
We study online resource allocation problems with a diseconomy of scale. In these problems, there are certain requests, each demanding a set of resources, that arrive in an online manner. The cost of each resource is semi-convex and grows …
View article: The Online Best Reply Algorithm for Resource Allocation Problems
The Online Best Reply Algorithm for Resource Allocation Problems Open
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 of resources and a set of requests that arrive in an online…
View article: Competitive Packet Routing with Priority Lists
Competitive Packet Routing with Priority Lists Open
In competitive packet routing games, packets are routed selfishly through a network and scheduling policies at edges determine which packages are forwarded first if there is not enough capacity on an edge to forward all packages at once. W…