scientific article; zbMATH DE number 7077336
From MaRDI portal
Publication:5223069
zbMATH Open1492.68034MaRDI QIDQ5223069FDOQ5223069
Authors: Jay Cummings, Joe Ezaki 
Publication date: 5 July 2019
Full work available at URL: https://journals.calstate.edu/pump/article/view/156
Title of this publication is not available (Why is that?)
Recommendations
- The Secretary Problem and Its Extensions: A Review
- The (generalized) secretary's packet problem and the Bell numbers
- The Byzantine generals problem
- Improved algorithms and analysis for secretary problems and generalizations
- Remarks on the Secretary Problem
- Sending secrets swiftly: approximation algorithms for generalized multicast problems
- Towards a faster BitTorrent
Cites Work
- Title not available (Why is that?)
- Who solved the secretary problem
- A secretary problem with uncertain employment
- Optimal stopping with sampling cost: The secretary problem
- Selected papers of Frederick Mosteller
- The finite-memory secretary problem
- Optimal selection based on relative rank (the 'Secretary Problem')
- Optimal Sequential Selection Based on Relative Ranks with Renewable Call Options
- Best-choice problems involving uncertainty of selection and recall of observations
- Recognizing the maximum of a random sequence based on relative rank with backward solicitation
- The Secretary Problem with Optimal Assignment
- The infinite secretary problem
- The infinite secretary problem as the limit of the finite problem
- A Secretary Problem with Finite Memory
- A SECRETARY PROBLEM WITH DOUBLE CHOICES
- On a Generalization of the Best Choice Problem
- Generalizing the secretary problem
- THE SECRETARY PROBLEMTHE CASE WITH MEMORY FOR ONE STEP
Cited In (2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223069)
