3 citations · 6 across the 3 of their papers we have counts for
4 papers
On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
Umang Bhaskar, Katharina Eickhoff, Lennart Kauther +3
In train routing, the headway is the minimum distance that must be maintained between successive trains for safety and robustness. We introduce a model for train routing that requi…
Faster Dynamic Auctions via Polymatroid Sum
Katharina Eickhoff, Meike Neuwohner, Britta Peis +3
We consider dynamic auctions for finding Walrasian equilibria in markets with indivisible items and strong gross substitutes valuation functions. Each price adjustment step in thes…
Stackelberg Vertex Cover on a Path
Katharina Eickhoff, Lennart Kauther, Britta Peis
A Stackelberg Vertex Cover game is played on an undirected graph where some of the vertices are under the control of a \emph{leader}. The remaining vertices are assig…
A flow-based ascending auction to compute buyer-optimal Walrasian prices
Katharina Eickhoff, S. Thomas McCormick, Britta Peis +2
We consider a market where a set of objects is sold to a set of buyers, each equipped with a valuation function for the objects. The goal of the auctioneer is to determine reasonab…