scientific article; zbMATH DE number 7053387

zbMath1421.68241MaRDI QIDQ5743511

Sourav Chakraborty, Oded Lachish

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095251

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

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Combinatorial aspects of matroids and geometric lattices (05B35) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (12)

Approximation algorithms for stochastic combinatorial optimization problems ⋮ The simulated greedy algorithm for several submodular matroid secretary problems ⋮ A Framework for the Secretary Problem on the Intersection of Matroids ⋮ Constant-competitiveness for random assignment matroid secretary without knowing the matroid ⋮ Generalized laminar matroids ⋮ Matroid-constrained vertex cover ⋮ Matroid prophet inequalities and applications to multi-dimensional mechanism design ⋮ Laminar matroids ⋮ On variants of the matroid secretary problem ⋮ The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids ⋮ A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive Weighted Matching in Transversal Matroids
• Submodular Secretary Problem and Extensions
• A Knapsack Secretary Problem with Applications
• The Secretary Problem and Its Extensions: A Review
• Matroid Secretary Problems
• Algorithms for Secretary Problems on Graphs and Hypergraphs
• Dynamic Programming and Decision Theory

This page was built for publication: