3 papers
cs.DS2026
Submodular Max-Min Allocation under Identical Valuations
Kimon Boehmer
In the problem of Submodular Max-Min Allocation, we are given a set of items, a set of players, and monotone submodular valuation functions that represent the satisfaction of a pla…
cs.DS2024
Arcee: An OCM-Solver
Kimon Boehmer, Lukas Lee George, Fanny Hauser +1
The 2024 PACE Challenge focused on the One-Sided Crossing Minimization (OCM) problem, which aims to minimize edge crossings in a bipartite graph with a fixed order in one partition…
cs.GT2024
Worst- and Average-Case Robustness of Stable Matchings: (Counting) Complexity and Experiments
Kimon Boehmer, Niclas Boehmer
Focusing on the bipartite Stable Marriage problem, we investigate different robustness measures related to stable matchings. We analyze the computational complexity of computing th…