17 citations · 35 across the 13 of their papers we have counts for
18 papers
A sharp bound on the integrality gap in the 3-set cover problem
Eli Berger, Ron Holzman
Given a hypergraph with edges of size at most 3, the 3-set cover problem asks to determine the minimum size of a family of edges which covers the vertex set. As the problem is NP-h…
Uniform Laws of Large Numbers in Product Spaces
Ron Holzman, Shay Moran, Alexander Shlimovich
Uniform laws of large numbers form a cornerstone of Vapnik--Chervonenkis theory, where they are characterized by the finiteness of the VC dimension. In this work, we study uniform…
The Domain of RSD Characterization by Efficiency, Symmetry, and Strategy-Proofness
Maor Ben Zaquen, Ron Holzman
Given a set of individuals with strict preferences over indivisible objects, the Random Serial Dictatorship (RSD) mechanism is a method for allocating objects to individual…
Triangle-free triple systems
Peter Frankl, Zoltán Füredi, Ido Goorevitch +2
There are four non-isomorphic configurations of triples that can form a triangle in a -uniform hypergraph. Forbidding different combinations of these four configurations, fiftee…
Fair Division via Quantile Shares
Yakov Babichenko, Michal Feldman, Ron Holzman +1
We consider the problem of fair division, where a set of indivisible goods should be distributed fairly among a set of agents with combinatorial valuations. To capture fairness, we…
The minimax property in infinite two-person win-lose games
Ron Holzman
We explore a version of the minimax theorem for two-person win-lose games with infinitely many pure strategies. In the countable case, we give a combinatorial condition on the game…