The Temp Secretary Problem

DOI10.1007/978-3-662-48350-3_53zbMath1398.68688arXiv1507.01732OpenAlexW2295088370MaRDI QIDQ3452826

Slava Novgorodov, Haim Kaplan, Ilia Gorelik, Amos Fiat

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.01732

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Auctions, bargaining, bidding and selling, and other market models (91B26) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Approximation algorithms for stochastic online matching with reusable resources ⋮ Packing returning secretaries ⋮ Hiring Secretaries over Time: The Benefit of Concurrent Employment ⋮ Know when to persist: deriving value from a stream buffer ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified approach to a class of best choice problems with an unknown number of options
• On-line scheduling of jobs with fixed start and end times
• On the Independence Number of Random Interval Graphs
• An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
• Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)
• A Knapsack Secretary Problem with Applications
• The Secretary Problem and Its Extensions: A Review
• Random Intervals
• Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons
• Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
• Primal beats dual on online packing LPs in the random-order model
• Algorithms for Secretary Problems on Graphs and Hypergraphs
• A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
• Dynamic Programming and Decision Theory
• Packing random intervals

This page was built for publication: The Temp Secretary Problem