שימושים בתורת המשחקים למציאת תהליכי בחירה עבור וועדות ולבעית האימפלמנטציה (Applications of game theory in finding choice procedures for committees and in the implementaion problem.). - Ron Holzman (1984)

Some Bounds for the Banzhaf Index and Other Semivalues. - Ron Holzman; Ehud Lehrer; Nathan Linial (Math. Oper. Res., 1988)

To vote or not to vote: What is the quota? - Ron Holzman (Discret. Appl. Math., 1989)

Representations of families of triples over GF(2). - Zoltán Füredi; Jerrold R. Griggs; Ron Holzman; Daniel J. Kleitman (J. Comb. Theory A, 1990)

An Axiomatic Approach to Location on Networks. - Ron Holzman (Math. Oper. Res., 1990)

Sign vectors and unit vectors. - Ron Holzman; Daniel J. Kleitman (Comb., 1992)

Optimal fractional matchings and covers in infinite hypergraphs: Existence and duality. - Ron Aharoni; Ron Holzman (Graphs Comb., 1992)

How to Guess Two Letters Correctly. - Ron Aharoni; Ron Holzman (J. Comb. Theory A, 1992)

Approximations of pseudo-Boolean functions; applications to game theory. - Peter L. Hammer; Ron Holzman (ZOR Methods Model. Oper. Res., 1992)

Packing lines in a hypercube. - Alexander Felzenbaum; Ron Holzman; Daniel J. Kleitman (Discret. Math., 1993)

Load Balancing in Quorum Systems (Extended Abstract). - Ron Holzman; Yosi Marcus; David Peleg (WADS, 1995)

Cancellative pairs of families of sets. - Ron Holzman; János Körner (Eur. J. Comb., 1995)

On a Theorem of Lovász on Covers in tau-Partite Hypergraphs. - Ron Aharoni; Ron Holzman; Michael Krivelevich (Comb., 1996)

On k-saturated graphs with restrictions on the degrees. - Noga Alon; Paul Erdös; Ron Holzman; Michael Krivelevich (J. Graph Theory, 1996)

Load Balancing in Quorum Systems. - Ron Holzman; Yosi Marcus; David Peleg (SIAM J. Discret. Math., 1997)

Fractional Kernels in Digraphs. - Ron Aharoni; Ron Holzman (J. Comb. Theory B, 1998)

The majority action on infinite graphs: strings and puppets. - Yuval Ginosar; Ron Holzman (Discret. Math., 2000)

Six Lonely Runners. - Tom Bohman; Ron Holzman; Daniel J. Kleitman (Electron. J. Comb., 2001)

The comparability of the classical and the Mas-Colell bargaining sets. - Ron Holzman (Int. J. Game Theory, 2001)

Fractional Planks. - Ron Aharoni; Ron Holzman; Michael Krivelevich; Roy Meshulam (Discret. Comput. Geom., 2002)

On partitions of discrete boxes. - Noga Alon; Tom Bohman; Ron Holzman; Daniel J. Kleitman (Discret. Math., 2002)

On a list coloring conjecture of Reed. - Tom Bohman; Ron Holzman (J. Graph Theory, 2002)

The core and the bargaining set in glove-market games. - Yevgenia Apartsin; Ron Holzman (Int. J. Game Theory, 2003)

Network structure and strong equilibrium in route selection games. - Ron Holzman; Nissan Law-yone (Math. Soc. Sci., 2003)

A nontrivial lower bound on the Shannon capacities of the complements of odd cycles. - Tom Bohman; Ron Holzman (IEEE Trans. Inf. Theory, 2003)

Linear Versus Hereditary Discrepancy. - Tom Bohman; Ron Holzman (Comb., 2004)

Bundling equilibrium in combinatorial auctions. - Ron Holzman; Noa E. Kfir-Dahav; Dov Monderer; Moshe Tennenholtz (Games Econ. Behav., 2004)

Characterization of ex post equilibrium in the VCG combinatorial auctions. - Ron Holzman; Dov Monderer (Games Econ. Behav., 2004)

Bargaining Sets of Majority Voting Games. - Ron Holzman; Bezalel Peleg; Peter Sudhölter (Math. Oper. Res., 2007)

On s-intersecting curves and related problems. - Sarit Buzaglo; Ron Holzman; Rom Pinchasi (SCG, 2008)

Projecting Difference Sets on the Positive Orthant. - Ron Holzman; Vsevolod F. Lev; Rom Pinchasi (Comb. Probab. Comput., 2008)

Independence - domination duality. - Ron Aharoni; Eli Berger; Ron Holzman; Ori Kfir (J. Comb. Theory B, 2008)

Maximum Independent Sets in Certain Powers of Odd Cycles. - Tom Bohman; Ron Holzman; Venkatesh Natarajan (Electron. J. Comb., 2009)

Aggregation of binary evaluations for truth-functional agendas. - Elad Dokow; Ron Holzman (Soc. Choice Welf., 2009)

Aggregation of non-binary evaluations. - Elad Dokow; Ron Holzman (Adv. Appl. Math., 2010)

Aggregation of binary evaluations. - Elad Dokow; Ron Holzman (J. Econ. Theory, 2010)

Aggregation of binary evaluations with abstentions. - Elad Dokow; Ron Holzman (J. Econ. Theory, 2010)

Sharing the Cost of a Capacity Network. - Anna Bogomolnaia; Ron Holzman; Hervé Moulin 001 (Math. Oper. Res., 2010)

On the Independence Numbers of the Cubes of Odd Cycles. - Tom Bohman; Ron Holzman; Venkatesh Natarajan (Electron. J. Comb., 2013)

Matching of like rank and the size of the core in the marriage problem. - Ron Holzman; Dov Samet (Games Econ. Behav., 2014)

Cooperative Colorings and Independent Systems of Representatives. - Ron Aharoni; Ron Holzman; David M. Howard 002; Philipp Sprüssel (Electron. J. Comb., 2015)

Strong equilibrium in network congestion games: increasing versus decreasing costs. - Ron Holzman; Dov Monderer (Int. J. Game Theory, 2015)

Tomaszewski's Problem on Randomly Signed Sums: Breaking the 3/8 Barrier. - Ravi B. Boppana; Ron Holzman (Electron. J. Comb., 2017)

Edge-Covers in d-Interval Hypergraphs. - Ron Aharoni; Ron Holzman; Shira Zerbib (Discret. Comput. Geom., 2017)

Representations of Political Power Structures by Strategically Stable Game Forms: A Survey. - Bezalel Peleg; Ron Holzman (Games, 2017)

Rainbow Fractional Matchings. - Ron Aharoni; Ron Holzman; Zilin Jiang (Comb., 2019)

Simultaneous Linear Discrepancy for Unions of Intervals. - Ron Holzman; Nitzan Tur (Comb., 2019)

On 2-colored graphs and partitions of boxes. - Ron Holzman (Eur. J. Comb., 2019)

Rainbow triangles and the Caccetta-Häggkvist conjecture. - Ron Aharoni; Matt DeVos; Ron Holzman (J. Graph Theory, 2019)

A Theory of PAC Learnability of Partial Concept Classes. - Noga Alon; Steve Hanneke; Ron Holzman; Shay Moran (FOCS, 2021)

A bound for 1-cross intersecting set pair systems. - Ron Holzman (Eur. J. Comb., 2021)

Rainbow Odd Cycles. - Ron Aharoni; Joseph Briggs; Ron Holzman; Zilin Jiang (SIAM J. Discret. Math., 2021)

On convex holes in d-dimensional point sets. - Boris Bukh; Ting-Wei Chao; Ron Holzman (Comb. Probab. Comput., 2022)

Fair Division via Quantile Shares. - Yakov Babichenko; Michal Feldman; Ron Holzman; Vishnu V. Narayan (STOC, 2024)

The Minimax Property in Infinite Two-Person Win-Lose Games. - Ron Holzman (Math. Oper. Res., 2025)