Exact Bounds for the Stochastic Upward Matching Problem

DOI10.2307/2000753zbMath0659.60026OpenAlexW4256512550MaRDI QIDQ3808933

WanSoo T. Rhee, Michel Talagrand

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/2000753

zbMATH Keywords

empirical discrepancyempirical processesbin packingmajorizing measureslower classesinfinitely divisible limits

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Sample path properties (60G17) Convergence of probability measures (60B10)

Related Items

Optimal Matching and Empirical Measures, Optimal random matchings, tours, and spanning trees in hierarchically separated trees, Matching Theorems and Empirical Discrepancy Computations using Majorizing Measures, Average-case analysis of cutting and packing in two dimensions

Cites Work

• Unnamed Item
• Regularity of Gaussian processes
• Some limit theorems for empirical processes (with discussion)
• The average-case analysis of some on-line algorithms for bin packing
• Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
• The sizes of compact subsets of Hilbert space and continuity of Gaussian processes