Niklas Rieken

Niklas Rieken

Auto-generated profile, based on publicly available information

Niklas Rieken

RWTH Aachen University, Aachen, Germany

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 April 2024 in Networks
Verified
Journal Article
Open access
KEKatharina Eickhoff
Katharina Eickhoff
SMS. Thomas McCormick
S. Thomas McCormick
BPBritta Peis
Britta Peis
NRNiklas Rieken
Niklas Rieken
LKLaura Vargas Koch
Laura Vargas Koch

16 June 2025 in ACM Transactions on Economics and Computation
Verified
Journal Article
Open access
KEKatharina Eickhoff
Katharina Eickhoff
MNMeike Neuwohner
Meike Neuwohner
BPBritta Peis
Britta Peis
NRNiklas Rieken
Niklas Rieken
LKLaura Vargas Koch
Laura Vargas Koch
LVLászló A. Végh
László A. Végh
We consider dynamic auctions for finding Walrasian equilibria in markets with indivisible items and strong gross substitutes valuation functions. Each price adjustment step in these auction algorithms requires finding an inclusion-wise minimal maximally overdemanded set or an inclusion-wise minimal maximally underdemanded set at the current prices. Both can be formulated as a submodular function minimization problem. We observe that minimizing this submodular function corresponds to a polymatroid sum problem, and using this viewpoint, we give a fast and simple push-relabel algorithm for finding the required sets. This improves on the previously best running time of Murota, Shioura and Yang (ISAAC 2013). Our algorithm is an adaptation of the push-relabel framework by Frank and Miklós (JJIAM 2012) to the particular setting. We obtain a further improvement for the special case of unit-supplies. We further show the following monotonicity properties of Walrasian prices: both the minimal and maximal Walrasian prices can only increase if supply of goods decreases, or if the demand of buyers increases. This is derived from a fine-grained analysis of market prices. We call packing prices a price vector such that there is a feasible allocation where each buyer obtains a utility maximizing set. Conversely, by covering prices we mean a price vector such that there exists a collection of utility maximizing sets of the buyers that include all available goods. We show that for strong gross substitutes valuations, the component-wise minimal packing prices coincide with the minimal Walrasian prices and the component-wise maximal covering prices coincide with the maximal Walrasian prices. These properties in turn lead to the price monotonicity results.

22 July 2025
Verified
Conference Paper
Open access
IKIke Kunze
Ike Kunze
CSConstantin Sander
Constantin Sander
ARAlexander Ruhrmann
Alexander Ruhrmann
NRNiklas Rieken
Niklas Rieken
KWKlaus Wehrle
Klaus Wehrle

2 October 2025 in Operations Research Letters
Verified
Journal Article
Open access
BPBritta Peis
Britta Peis
NRNiklas Rieken
Niklas Rieken