Strong Algorithms for the Ordinal Matroid Secretary Problem
From MaRDI portal
Publication:5000649
DOI10.1287/moor.2020.1083OpenAlexW3129885107MaRDI QIDQ5000649
Abner Turkieltaub, Víctor Verdugo, Jose A. Soto
Publication date: 15 July 2021
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.01997
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The simulated greedy algorithm for several submodular matroid secretary problems
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- On matroids induced by packing subgraphs
- Frame matroids and biased graphs
- Who solved the secretary problem? With comments and a rejoinder by the author
- On variants of the matroid secretary problem
- Competitive weighted matching in transversal matroids
- On graphs and rigidity of plane skeletal structures
- Improved Algorithms and Analysis for Secretary Problems and Generalizations
- 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
- Submodular secretary problem and extensions
- Secretary Problems with Non-Uniform Arrival Order
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)
- Natural realizations of sparsity matroids
- Polymatroid Prophet Inequalities
- A Knapsack Secretary Problem with Applications
- Combinatorial Prophet Inequalities
- Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
- Secretary Problems via Linear Programming
- Matroid Secretary for Regular and Decomposable Matroids
- 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
- Matroids Induced by Packing Subgraphs
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- Beyond matroids: secretary problem and prophet inequality with general constraints
- Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order
- Prophet Inequalities with Limited Information
- Matroid prophet inequalities
- Probability and Computing
- Transversals and matroid partition
- Dynamic Programming and Decision Theory
This page was built for publication: Strong Algorithms for the Ordinal Matroid Secretary Problem
