1 citations · 1 across the 7 of their papers we have counts for
5 papers · 1 filter
Computing the egalitarian allocation with network flows
T. Heller, S. O. Krumke
In a combinatorial exchange setting, players place sell (resp. buy) bids on combinations of traded goods. Besides the question of finding an optimal selection of winning bids, the…
The Reward-Penalty-Selection Problem
T. Heller, S. O. Krumke, K. -H. Küfer
The Set Cover Problem (SCP) and the Hitting Set Problem (HSP) are well-studied optimization problems. In this paper we introduce the Reward-Penalty-Selection Problem (RPSP) which c…
On the Connection between Individual Scaled Vickrey Payments and the Egalitarian Allocation
N. Gräf, T. Heller, S. O. Krumke
The Egalitarian Allocation (EA) is a well-known profit sharing method for cooperative games which attempts to distribute profit among participants in a most equal way while respect…
A unified approach to inverse robust optimization problems
Holger Berthold, Till Heller, Tobias Seidel
A variety of approaches has been developed to deal with uncertain optimization problems. Often, they start with a given set of uncertainties and then try to minimize the influence…
Algorithms and Complexity for the Almost Equal Maximum Flow Problem
Rebekka Haese, Till Heller, Sven O. Krumke
In the Equal Maximum Flow Problem (EMFP), we aim for a maximum flow where we require the same flow value on all edges in some given subsets of the edge set. In this paper, we study…