scientific article; zbMATH DE number 7077336

zbMath1492.68034MaRDI QIDQ5223069

Jay Cummings, Joe Ezaki

Publication date: 5 July 2019

Full work available at URL: https://journals.calstate.edu/pump/article/view/156

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

zbMATH Keywords

secretary problemBitTorrent protocol

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Network protocols (68M12)

Cites Work

• Unnamed Item
• Optimal stopping with sampling cost: The secretary problem
• The infinite secretary problem
• The infinite secretary problem as the limit of the finite problem
• The finite-memory secretary problem
• Who solved the secretary problem
• Selected papers of Frederick Mosteller
• Optimal selection based on relative rank (the 'Secretary Problem')
• Optimal Sequential Selection Based on Relative Ranks with Renewable Call Options
• The Secretary Problem with Optimal Assignment
• A SECRETARY PROBLEM WITH DOUBLE CHOICES
• Best-choice problems involving uncertainty of selection and recall of observations
• A secretary problem with uncertain employment
• A Secretary Problem with Finite Memory
• Recognizing the maximum of a random sequence based on relative rank with backward solicitation
• On a Generalization of the Best Choice Problem
• THE SECRETARY PROBLEMTHE CASE WITH MEMORY FOR ONE STEP
• Generalizing the secretary problem

This page was built for publication: