Exact Bounds for the Stochastic Upward Matching Problem

DOI10.2307/2000753zbMath0658.60023OpenAlexW4256512550MaRDI QIDQ3806444

Michel Talagrand, WanSoo T. Rhee

Publication date: 1988

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

zbMATH Keywords

empirical discrepancyempirical processesmaximal inequalitybin packingmajorizing measurerandomized empirical discrepancy

Mathematics Subject Classification ID

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

Related Items (1)

On rates of convergence and asymptotic normality in the multiknapsack problem

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

This page was built for publication: Exact Bounds for the Stochastic Upward Matching Problem