Strong Algorithms for the Ordinal Matroid Secretary Problem
type: Item
instance of: scholarly article
title: Strong Algorithms for the Ordinal Matroid Secretary Problem
author: José A. Soto
author: Abner Turkieltaub
author: Víctor Verdugo
published in: Mathematics of Operations Research
publication date: 2021-07-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/1802.01997
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 7371746
zbMATH Keywords: secretary problem
zbMATH Keywords: matroids
zbMATH Keywords: online algorithms
MaRDI profile type: Publication
OpenAlex ID: W3129885107
cites work: Improved algorithms and analysis for secretary problems and generalizations
cites work: Prophet Inequalities with Limited Information
cites work: Q2934624
cites work: A Knapsack Secretary Problem with Applications
cites work: Q4633940
cites work: Secretary Problems with Convex Costs
cites work: Submodular secretary problem and extensions
cites work: Secretary Problems via Linear Programming
cites work: Q5743511
cites work: Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order
cites work: Competitive weighted matching in transversal matroids
cites work: Matroid Secretary for Regular and Decomposable Matroids
cites work: Polymatroid Prophet Inequalities
cites work: Q5653410
cites work: Transversals and matroid partition
cites work: Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)
cites work: Q4607930
cites work: A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
cites work: Who solved the secretary problem? With comments and a rejoinder by the author
cites work: Q5111465
cites work: Q5365115
cites work: Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
cites work: Matroids Induced by Packing Subgraphs
cites work: Secretary Problems with Non-Uniform Arrival Order
cites work: An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
cites work: Primal beats dual on online packing LPs in the random-order model
cites work: A multiple-choice secretary algorithm with applications to online auctions
cites work: Matroid prophet inequalities
cites work: Algorithms for Secretary Problems on Graphs and Hypergraphs
cites work: On graphs and rigidity of plane skeletal structures
cites work: Dynamic Programming and Decision Theory
cites work: On matroids induced by packing subgraphs
cites work: Q4091971
cites work: The simulated greedy algorithm for several submodular matroid secretary problems
cites work: Probability and Computing
cites work: On variants of the matroid secretary problem
cites work: Beyond matroids: secretary problem and prophet inequality with general constraints
cites work: Combinatorial Prophet Inequalities
cites work: Matroid secretary problem in the random-assignment model
cites work: Q4607929
cites work: Natural realizations of sparsity matroids
cites work: Rigidity of multi-graphs. I: Linking rigid bodies in n-space
cites work: Q4717849
cites work: Frame matroids and biased graphs
DOI: 10.1287/MOOR.2020.1083
description: scientific article; zbMATH DE number 7371746