Ron Holzman

According to our database1, Ron Holzman authored at least 43 papers between 1988 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Representations of Political Power Structures by Strategically Stable Game Forms: A Survey.
Games, 2017

Edge-Covers in d-Interval Hypergraphs.
Discrete & Computational Geometry, 2017

Tomaszewski's Problem on Randomly Signed Sums: Breaking the 3/8 Barrier.
Electr. J. Comb., 2017

2015
Strong equilibrium in network congestion games: increasing versus decreasing costs.
Int. J. Game Theory, 2015

Cooperative Colorings and Independent Systems of Representatives.
Electr. J. Comb., 2015

2014
Matching of like rank and the size of the core in the marriage problem.
Games and Economic Behavior, 2014

2013
On the Independence Numbers of the Cubes of Odd Cycles.
Electr. J. Comb., 2013

2010
Sharing the Cost of a Capacity Network.
Math. Oper. Res., 2010

Aggregation of binary evaluations with abstentions.
J. Economic Theory, 2010

Aggregation of binary evaluations.
J. Economic Theory, 2010

2009
Aggregation of binary evaluations for truth-functional agendas.
Social Choice and Welfare, 2009

Maximum Independent Sets in Certain Powers of Odd Cycles.
Electr. J. Comb., 2009

2008
Independence - domination duality.
J. Comb. Theory, Ser. B, 2008

Projecting Difference Sets on the Positive Orthant.
Combinatorics, Probability & Computing, 2008

On s-intersecting curves and related problems.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Bargaining Sets of Majority Voting Games.
Math. Oper. Res., 2007

2004
Characterization of ex post equilibrium in the VCG combinatorial auctions.
Games and Economic Behavior, 2004

Bundling equilibrium in combinatorial auctions.
Games and Economic Behavior, 2004

Linear Versus Hereditary Discrepancy.
Combinatorica, 2004

2003
A nontrivial lower bound on the Shannon capacities of the complements of odd cycles.
IEEE Trans. Information Theory, 2003

Network structure and strong equilibrium in route selection games.
Mathematical Social Sciences, 2003

The core and the bargaining set in glove-market games.
Int. J. Game Theory, 2003

2002
On a list coloring conjecture of Reed.
Journal of Graph Theory, 2002

On partitions of discrete boxes.
Discrete Mathematics, 2002

Fractional Planks.
Discrete & Computational Geometry, 2002

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

Six Lonely Runners.
Electr. J. Comb., 2001

2000
The majority action on infinite graphs: strings and puppets.
Discrete Mathematics, 2000

1998
Fractional Kernels in Digraphs.
J. Comb. Theory, Ser. B, 1998

1997
Load Balancing in Quorum Systems.
SIAM J. Discrete Math., 1997

1996
On k-saturated graphs with restrictions on the degrees.
Journal of Graph Theory, 1996

On a Theorem of Lovász on Covers in tau-Partite Hypergraphs.
Combinatorica, 1996

1995
Cancellative pairs of families of sets.
Eur. J. Comb., 1995

Load Balancing in Quorum Systems (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1993
Packing lines in a hypercube.
Discrete Mathematics, 1993

1992
Approximations of pseudo-Boolean functions; applications to game theory.
ZOR - Meth. & Mod. of OR, 1992

How to Guess Two Letters Correctly.
J. Comb. Theory, Ser. A, 1992

Optimal fractional matchings and covers in infinite hypergraphs: Existence and duality.
Graphs and Combinatorics, 1992

Sign vectors and unit vectors.
Combinatorica, 1992

1990
An Axiomatic Approach to Location on Networks.
Math. Oper. Res., 1990

Representations of families of triples over GF(2).
J. Comb. Theory, Ser. A, 1990

1989
To vote or not to vote: What is the quota?
Discrete Applied Mathematics, 1989

1988
Some Bounds for the Banzhaf Index and Other Semivalues.
Math. Oper. Res., 1988


  Loading...