Secretary Problems via Linear Programming

DOI10.1287/moor.2013.0604zbMath1305.90344OpenAlexW2074829830MaRDI QIDQ5169698

No author found.

Publication date: 11 July 2014

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2013.0604

zbMATH Keywords

linear programmingsecretary problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (11)

The Secretary Problem—An Update ⋮ New results for the \(k\)-secretary problem ⋮ Unnamed Item ⋮ Knapsack secretary through boosting ⋮ Generalized Sequential Stochastic Assignment Problem ⋮ The secretary problem with reservation costs ⋮ Strategy-indifferent games of best choice ⋮ Avoiding patterns and making the best choice ⋮ Online Vertex-Weighted Bipartite Matching ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem ⋮ Online Allocation and Pricing: Constant Regret via Bellman Inequalities

This page was built for publication: Secretary Problems via Linear Programming