In Arnosti’s random bipartite matching model with independent uniform job neighbourhoods of prescribed sizes and a common positive integer bin capacity, RANDOM-VERTEX stochastically dominates RANKING in the number of accepted jobs.
In Arnosti’s random bipartite matching model with independent uniform job neighbourhoods of prescribed sizes and a common positive integer bin capacity, RANDOM-VERTEX stochastically dominates RANKING in the number of accepted jobs.
In Arnosti’s random bipartite matching model with independent uniform job neighbourhoods of prescribed sizes and a common positive integer bin capacity, RANDOM-VERTEX stochastically dominates RANKING in the number of accepted jobs.
If correct, settles the equal-capacity comparison for all finite instances of Arnosti’s random-neighbourhood model.
Does RANDOM-VERTEX stochastically dominate RANKING in matching size for every common bin capacity?
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
