4 papers
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…
More on the Erd\H os--Kleitman problem on matchings in set families
Andrey Kupavskii, Georgy Sokolov
Let denote the maximum size of a family of subsets of an -element set that contains no pairwise disjoint members. In 1968, answering a question of Erd…
Forbidding just one intersection for short integer sequences
Elizaveta Iarovikova, Fedor Noskov, Georgy Sokolov +1
In this paper, we study the famous Erdős--Sós forbidden intersection problem for words over an alphabet of size : what is the maximal size of a subfamily of $[m]^n…
A complete solution of the Erdős-Kleitman matching problem for
Andrey Kupavskii, Georgy Sokolov
Given integers , let stand for the maximum size of a family of subsets of an -element set that contains no pairwise disjoint members. The study of this…