Showing cs.DMShow all
2 papers · 1 filter
cs.DM2026
Nearly Tight Bounds for Proportional Group Fair Divisions and One-Sided Discrepancy
Alexander Shekhovtsov, Georgy Sokolov, Mikhail Cherniavskii +1
This paper studies the problem of fair division of indivisible goods among groups of agents. We look at the worst downward deviation $\textit{PROP}(n_1,\ldots…
cs.DM2025
Near-optimal edge partitioning via intersecting families
Alexander Yakunin, Andrey Kupavskii, Alexander Sushin +1
We study the problem of edge partitioning, where the goal is to partition the edge set of a graph into parts. The replication factor of a vertex is the number of parts that…