Secretary Problems via Linear Programming

DOI10.1287/MOOR.2013.0604MaRDI QIDQ5169698zbMATH OpenOpenAlexFDO

Authors

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)

Recommendations

• Secretary Problems via Linear Programming
• The Secretary Problem with Optimal Assignment
• scientific article; zbMATH DE number 3986306
• A generalized secretary problem
• The submodular secretary problem goes linear
• Secretary problems with convex costs
• Secretary problems: laminar matroid and interval scheduling
• APPROXIMATE RESULTS FOR A GENERALIZED SECRETARY PROBLEM
• Some Extensions of Generalized Secretary Problem
• The solution of a generalized secretary problem via analytic expressions

Cited in

(30)

• Avoiding patterns and making the best choice
• Stable secretaries
• The solution of a generalized secretary problem via analytic expressions
• Strategy-indifferent games of best choice
• New results for the \(k\)-secretary problem
• The secretary problem with reservation costs
• Improved algorithms and analysis for secretary problems and generalizations
• Secretary Problems via Linear Programming
• scientific article; zbMATH DE number 4003908 (Why is no real title available?)
• scientific article; zbMATH DE number 572375 (Why is no real title available?)
• Think eternally: improved algorithms for the temp secretary problem and extensions
• Matroid Secretary Problems
• Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
• Strong algorithms for the ordinal matroid secretary problem
• scientific article; zbMATH DE number 7376006 (Why is no real title available?)
• Online allocation and pricing: constant regret via Bellman inequalities
• The Secretary Problem—An Update
• Hiring secretaries over time: the benefit of concurrent employment
• Generalized sequential stochastic assignment problem
• Knapsack secretary through boosting
• Algorithms for maximum social welfare of online random trading
• Secretaries with advice
• The secretary problem with predictions
• Selection and ordering policies for hiring pipelines via linear programming
• Competitive analysis with a sample and the secretary problem
• The average-value allocation problem
• Incentivizing hidden types in secretary problem
• Competitive secretary problem
• Edge arrival online matching: the power of free disposal on acyclic graphs
• Dynamic programming and the secretary problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5169698)