scientific article; zbMATH DE number 7561419

DOI10.4230/LIPIcs.ISAAC.2018.65MaRDI QIDQ5091060

Lisa Wilhelmi, Martin Hoefer

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1810.11216

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matroidssecretary problemcoupon collector problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Packing returning secretaries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Who solved the secretary problem
• A survey of the coupon collector's problem with random sample sizes
• Geometry of Online Packing Linear Programs
• An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
• The Returning Secretary
• The coupon-collector problem revisited — a survey of engineering problems and computational methods
• Secretary Markets with Local Information
• The Temp Secretary Problem
• A Knapsack Secretary Problem with Applications
• Matroid Secretary Problems
• The Submodular Secretary Problem Goes Linear
• Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints
• Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
• On Maximizing Welfare When Utility Functions Are Subadditive
• A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
• Primal beats dual on online packing LPs in the random-order model
• Algorithms for Secretary Problems on Graphs and Hypergraphs
• Beyond matroids: secretary problem and prophet inequality with general constraints

This page was built for publication: