A Framework for the Secretary Problem on the Intersection of Matroids
From MaRDI portal
Publication:5087013
DOI10.1137/21M1411822zbMath1497.68610MaRDI QIDQ5087013
Ola Svensson, Moran Feldman, Rico Zenklusen
Publication date: 8 July 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms (68W40) Stopping times; optimal stopping problems; gambling theory (60G40) Combinatorial aspects of matroids and geometric lattices (05B35) Optimal stopping in statistics (62L15) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The matroids with the max-flow min-cut property
- Who solved the secretary problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On variants of the matroid secretary problem
- Competitive weighted matching in transversal matroids
- Matroid Secretary Problem in the Random-Assignment Model
- Secretary Problems with Convex Costs
- An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
- Multi-parameter mechanism design and sequential posted pricing
- Submodular secretary problem and extensions
- Secretary Problems with Non-Uniform Arrival Order
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)
- Polymatroid Prophet Inequalities
- A Knapsack Secretary Problem with Applications
- An Analysis of the Greedy Heuristic for Independence Systems
- Matroid Secretary Problems
- The Submodular Secretary Problem Goes Linear
- Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
- Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
- Matroid Secretary for Regular and Decomposable Matroids
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- Beyond matroids: secretary problem and prophet inequality with general constraints
- A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
- Prophet Inequalities with Limited Information
- Fast algorithms for maximizing submodular functions
- Matroid prophet inequalities
- Dynamic Programming and Decision Theory
- Online Contention Resolution Schemes with Applications to Bayesian Selection Problems
This page was built for publication: A Framework for the Secretary Problem on the Intersection of Matroids