The solution of a generalized secretary problem via analytic expressions

DOI10.1007/s10878-016-0050-8zbMath1406.90110arXiv1607.07658OpenAlexW3100269656WikidataQ59608693 ScholiaQ59608693MaRDI QIDQ2012898

Adam Woryna

Publication date: 3 August 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

optimal stoppingcombinatorial identitysecretary problemoptimal sequenceanalytic expression

Mathematics Subject Classification ID

Applications of statistics to social sciences (62P25) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorial optimization (90C27) Combinatorial probability (60C05) Applications of hypergeometric functions (33C90)

Related Items (4)

A satisficing policy of the secretary problem: theory and simulation ⋮ A unified approach for solving sequential selection problems ⋮ Unnamed Item ⋮ Progressive stopping heuristics that excel in individual and competitive sequential search

Cites Work

• Unnamed Item
• A unified approach to a class of best choice problems with an unknown number of options
• On an optimal stopping problem of Gusein-Zade
• Improved Algorithms and Analysis for Secretary Problems and Generalizations
• Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol
• APPROXIMATE RESULTS FOR A GENERALIZED SECRETARY PROBLEM
• Secretary Problems via Linear Programming
• The Secretary Problem and Its Extensions: A Review
• Exact results for a secretary problem
• Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order
• Dynamic Programming and Decision Theory

This page was built for publication: The solution of a generalized secretary problem via analytic expressions