3 papers
cs.GT2026
The Power of Share-Based Notions in Proving Envy-Based Fairness Guarantees
Hannaneh Akrami, Uriel Feige, Ryoga Mahara +2
We study the problem of fairly allocating indivisible goods among agents with monotone valuations. We introduce a new share-based fairness notion, the residual maximin share (RMMS)…
cs.LO2025
A Formal Correctness Proof of Edmonds' Blossom Shrinking Algorithm
Mohammad Abdulaziz, Kurt Mehlhorn
We present the first formal correctness proof of Edmonds' blossom shrinking algorithm for maximum cardinality matching in general graphs. We focus on formalising the mathematical s…
cond-mat.stat-mech2024
Self-organized transport in noisy dynamic networks
Frederic Folz, Kurt Mehlhorn, Giovanna Morigi
We present a numerical study of multi-commodity transport in a noisy, nonlinear network. The nonlinearity determines the dynamics of the edge capacities, which can be amplified or…