default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRon Holzman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]Yakov Babichenko
, Michal Feldman, Ron Holzman, Vishnu V. Narayan:
Fair Division via Quantile Shares. STOC 2024: 1235-1246- 2023
- [i6]Ron Holzman:
The minimax property in infinite two-person win-lose games. CoRR abs/2310.19314 (2023) - [i5]Yakov Babichenko, Michal Feldman, Ron Holzman, Vishnu V. Narayan:
Fair Division via Quantile Shares. CoRR abs/2312.01874 (2023) - 2022
- [j49]Boris Bukh, Ting-Wei Chao, Ron Holzman:
On convex holes in d-dimensional point sets. Comb. Probab. Comput. 31(1): 101-108 (2022) - 2021
- [j48]Ron Holzman:
A bound for 1-cross intersecting set pair systems. Eur. J. Comb. 96: 103345 (2021) - [j47]Ron Aharoni, Joseph Briggs, Ron Holzman, Zilin Jiang:
Rainbow Odd Cycles. SIAM J. Discret. Math. 35(4): 2293-2303 (2021) - [c3]Noga Alon, Steve Hanneke, Ron Holzman, Shay Moran:
A Theory of PAC Learnability of Partial Concept Classes. FOCS 2021: 658-671 - [i4]Noga Alon, Steve Hanneke, Ron Holzman, Shay Moran:
A Theory of PAC Learnability of Partial Concept Classes. CoRR abs/2107.08444 (2021) - 2020
- [i3]Boris Bukh, Ting-Wei Chao, Ron Holzman:
On convex holes in d-dimensional point sets. CoRR abs/2007.08972 (2020)
2010 – 2019
- 2019
- [j46]Ron Holzman, Nitzan Tur:
Simultaneous Linear Discrepancy for Unions of Intervals. Comb. 39(1): 85-90 (2019) - [j45]Ron Aharoni, Ron Holzman, Zilin Jiang:
Rainbow Fractional Matchings. Comb. 39(6): 1191-1202 (2019) - [j44]Ron Holzman:
On 2-colored graphs and partitions of boxes. Eur. J. Comb. 79: 214-221 (2019) - [j43]Ron Aharoni, Matt DeVos, Ron Holzman:
Rainbow triangles and the Caccetta-Häggkvist conjecture. J. Graph Theory 92(4): 347-360 (2019) - 2018
- [i2]Ron Holzman:
On 2-colored graphs and partitions of boxes. CoRR abs/1810.08920 (2018) - 2017
- [j42]Ravi B. Boppana, Ron Holzman:
Tomaszewski's Problem on Randomly Signed Sums: Breaking the 3/8 Barrier. Electron. J. Comb. 24(3): 3 (2017) - [j41]Ron Aharoni, Ron Holzman, Shira Zerbib:
Edge-Covers in d-Interval Hypergraphs. Discret. Comput. Geom. 58(3): 650-662 (2017) - [j40]Bezalel Peleg, Ron Holzman:
Representations of Political Power Structures by Strategically Stable Game Forms: A Survey. Games 8(4): 46 (2017) - 2015
- [j39]Ron Aharoni, Ron Holzman, David M. Howard, Philipp Sprüssel:
Cooperative Colorings and Independent Systems of Representatives. Electron. J. Comb. 22(2): 2 (2015) - [j38]Ron Holzman, Dov Monderer:
Strong equilibrium in network congestion games: increasing versus decreasing costs. Int. J. Game Theory 44(3): 647-666 (2015) - 2014
- [j37]Ron Holzman, Dov Samet:
Matching of like rank and the size of the core in the marriage problem. Games Econ. Behav. 88: 277-285 (2014) - 2013
- [j36]Tom Bohman, Ron Holzman, Venkatesh Natarajan:
On the Independence Numbers of the Cubes of Odd Cycles. Electron. J. Comb. 20(3): 10 (2013) - 2010
- [j35]Elad Dokow, Ron Holzman:
Aggregation of non-binary evaluations. Adv. Appl. Math. 45(4): 487-504 (2010) - [j34]Elad Dokow, Ron Holzman:
Aggregation of binary evaluations. J. Econ. Theory 145(2): 495-511 (2010) - [j33]Elad Dokow, Ron Holzman:
Aggregation of binary evaluations with abstentions. J. Econ. Theory 145(2): 544-561 (2010) - [j32]Anna Bogomolnaia, Ron Holzman, Hervé Moulin:
Sharing the Cost of a Capacity Network. Math. Oper. Res. 35(1): 173-192 (2010)
2000 – 2009
- 2009
- [j31]Tom Bohman, Ron Holzman, Venkatesh Natarajan:
Maximum Independent Sets in Certain Powers of Odd Cycles. Electron. J. Comb. 16(1) (2009) - [j30]Elad Dokow, Ron Holzman:
Aggregation of binary evaluations for truth-functional agendas. Soc. Choice Welf. 32(2): 221-241 (2009) - 2008
- [j29]Ron Holzman, Vsevolod F. Lev, Rom Pinchasi:
Projecting Difference Sets on the Positive Orthant. Comb. Probab. Comput. 17(5): 681-688 (2008) - [j28]Ron Aharoni, Eli Berger, Ron Holzman, Ori Kfir:
Independence - domination duality. J. Comb. Theory B 98(6): 1259-1270 (2008) - [c2]Sarit Buzaglo, Ron Holzman, Rom Pinchasi:
On s-intersecting curves and related problems. SCG 2008: 79-84 - 2007
- [j27]Ron Holzman, Bezalel Peleg, Peter Sudhölter:
Bargaining Sets of Majority Voting Games. Math. Oper. Res. 32(4): 857-872 (2007) - 2004
- [j26]Tom Bohman, Ron Holzman:
Linear Versus Hereditary Discrepancy. Comb. 25(1): 39-47 (2004) - [j25]Ron Holzman, Dov Monderer:
Characterization of ex post equilibrium in the VCG combinatorial auctions. Games Econ. Behav. 47(1): 87-103 (2004) - [j24]Ron Holzman, Noa E. Kfir-Dahav, Dov Monderer, Moshe Tennenholtz:
Bundling equilibrium in combinatorial auctions. Games Econ. Behav. 47(1): 104-123 (2004) - 2003
- [j23]Yevgenia Apartsin, Ron Holzman:
The core and the bargaining set in glove-market games. Int. J. Game Theory 32(2): 189-204 (2003) - [j22]Ron Holzman, Nissan Law-yone:
Network structure and strong equilibrium in route selection games. Math. Soc. Sci. 46(2): 193-205 (2003) - [j21]Tom Bohman, Ron Holzman:
A nontrivial lower bound on the Shannon capacities of the complements of odd cycles. IEEE Trans. Inf. Theory 49(3): 721-722 (2003) - 2002
- [j20]Ron Aharoni, Ron Holzman, Michael Krivelevich, Roy Meshulam:
Fractional Planks. Discret. Comput. Geom. 27(4): 585-602 (2002) - [j19]Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman:
On partitions of discrete boxes. Discret. Math. 257(2-3): 255-258 (2002) - [j18]Tom Bohman, Ron Holzman:
On a list coloring conjecture of Reed. J. Graph Theory 41(2): 106-109 (2002) - [i1]Ron Holzman, Noa E. Kfir-Dahav, Dov Monderer, Moshe Tennenholtz:
Bundling Equilibrium in Combinatorial auctions. CoRR cs.GT/0201010 (2002) - 2001
- [j17]Tom Bohman, Ron Holzman, Daniel J. Kleitman:
Six Lonely Runners. Electron. J. Comb. 8(2) (2001) - [j16]Ron Holzman:
The comparability of the classical and the Mas-Colell bargaining sets. Int. J. Game Theory 29(4): 543-553 (2001) - 2000
- [j15]Yuval Ginosar, Ron Holzman:
The majority action on infinite graphs: strings and puppets. Discret. Math. 215: 59-71 (2000)
1990 – 1999
- 1998
- [j14]Ron Aharoni, Ron Holzman:
Fractional Kernels in Digraphs. J. Comb. Theory B 73(1): 1-6 (1998) - 1997
- [j13]Ron Holzman, Yosi Marcus, David Peleg:
Load Balancing in Quorum Systems. SIAM J. Discret. Math. 10(2): 223-245 (1997) - 1996
- [j12]Ron Aharoni, Ron Holzman, Michael Krivelevich:
On a Theorem of Lovász on Covers in tau-Partite Hypergraphs. Comb. 16(2): 149-174 (1996) - [j11]Noga Alon, Paul Erdös, Ron Holzman, Michael Krivelevich:
On k-saturated graphs with restrictions on the degrees. J. Graph Theory 23(1): 1-20 (1996) - 1995
- [j10]Ron Holzman, János Körner:
Cancellative pairs of families of sets. Eur. J. Comb. 16(3): 263-266 (1995) - [c1]Ron Holzman, Yosi Marcus, David Peleg:
Load Balancing in Quorum Systems (Extended Abstract). WADS 1995: 38-49 - 1993
- [j9]Alexander Felzenbaum, Ron Holzman, Daniel J. Kleitman:
Packing lines in a hypercube. Discret. Math. 117(1-3): 107-112 (1993) - 1992
- [j8]Ron Holzman, Daniel J. Kleitman:
Sign vectors and unit vectors. Comb. 12(3): 303-316 (1992) - [j7]Ron Aharoni, Ron Holzman:
Optimal fractional matchings and covers in infinite hypergraphs: Existence and duality. Graphs Comb. 8(1): 11-22 (1992) - [j6]Ron Aharoni, Ron Holzman:
How to Guess Two Letters Correctly. J. Comb. Theory A 61(1): 1-12 (1992) - [j5]Peter L. Hammer, Ron Holzman:
Approximations of pseudo-Boolean functions; applications to game theory. ZOR Methods Model. Oper. Res. 36(1): 3-21 (1992) - 1990
- [j4]Zoltán Füredi, Jerrold R. Griggs, Ron Holzman, Daniel J. Kleitman:
Representations of families of triples over GF(2). J. Comb. Theory A 53(2): 306-315 (1990) - [j3]Ron Holzman:
An Axiomatic Approach to Location on Networks. Math. Oper. Res. 15(3): 553-563 (1990)
1980 – 1989
- 1989
- [j2]Ron Holzman:
To vote or not to vote: What is the quota? Discret. Appl. Math. 22(2): 133-141 (1989) - 1988
- [j1]Ron Holzman, Ehud Lehrer, Nathan Linial:
Some Bounds for the Banzhaf Index and Other Semivalues. Math. Oper. Res. 13(2): 358-363 (1988) - 1984
- [b1]Ron Holzman:
שימושים בתורת המשחקים למציאת תהליכי בחירה עבור וועדות ולבעית האימפלמנטציה (Applications of game theory in finding choice procedures for committees and in the implementaion problem.). Hebrew University of Jerusalem, Israel, 1984
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
