Strong algorithms for the ordinal matroid secretary problem
From MaRDI portal
Publication:5000649
DOI10.1287/MOOR.2020.1083OpenAlexW3129885107MaRDI QIDQ5000649FDOQ5000649
Authors: José A. Soto, Abner Turkieltaub, Víctor Verdugo 
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
Recommendations
Cites Work
- Frame matroids and biased graphs
- On graphs and rigidity of plane skeletal structures
- Title not available (Why is that?)
- Transversals and matroid partition
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Knapsack Secretary Problem with Applications
- Probability and Computing
- Matroid secretary problem in the random-assignment model
- A multiple-choice secretary algorithm with applications to online auctions
- Matroids, secretary problems, and online mechanisms
- Improved competitive ratios for submodular secretary problems (extended abstract)
- Matroid secretary for regular and decomposable matroids
- Primal beats dual on online packing LPs in the random-order model
- Secretary problems: laminar matroid and interval scheduling
- Matroid prophet inequalities
- Improved competitive ratio for the matroid secretary problem
- On variants of the matroid secretary problem
- Competitive weighted matching in transversal matroids
- The simulated greedy algorithm for several submodular matroid secretary problems
- Submodular secretary problem and extensions
- Title not available (Why is that?)
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- Natural realizations of sparsity matroids
- Prophet Inequalities with Limited Information
- Dynamic Programming and Decision Theory
- Who solved the secretary problem? With comments and a rejoinder by the author
- Improved algorithms and analysis for secretary problems and generalizations
- Advances on matroid secretary problems: free order model and laminar case
- On matroids induced by packing subgraphs
- Secretary Problems via Linear Programming
- Matroids Induced by Packing Subgraphs
- Strong algorithms for the ordinal matroid secretary problem
- An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
- Secretary Problems with Non-Uniform Arrival Order
- Beyond matroids: secretary problem and prophet inequality with general constraints
- Polymatroid Prophet Inequalities
- Combinatorial secretary problems with ordinal information
- Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- A framework for the secretary problem on the intersection of matroids
- Combinatorial prophet inequalities
- Secretary problems with convex costs
Cited In (6)
- Strong algorithms for the ordinal matroid secretary problem
- Combinatorial secretary problems with ordinal information
- Robust Algorithms for the Secretary Problem
- Formal barriers to simple algorithms for the matroid secretary problem
- Knapsack secretary through boosting
- Partial-order analogue of the secretary problem: The binary tree case
This page was built for publication: Strong algorithms for the ordinal matroid secretary problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000649)
