Sequential selections with minimization of failure

DOI10.1016/j.jmp.2022.102723zbMath1505.91155arXiv2205.09754OpenAlexW4306985844MaRDI QIDQ2677694

Krzysztof J. Szajowski

Publication date: 5 January 2023

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

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

zbMATH Keywords

optimal stoppingMarkov processsecretary problembehavioral ORbest choice problemultimatumDowry problemsequential search durationuncertain employment

Mathematics Subject Classification ID

Decision theory (91B06) Stopping times; optimal stopping problems; gambling theory (60G40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expected duration of the no-information minimum rank problem
• When to stop -- a cardinal secretary search experiment
• No-information secretary problems with cardinal payoffs and Poisson arrivals
• Selection of nonextremal candidates from a random sequence
• Who solved the secretary problem
• Analysis of heuristic solutions to the best choice problem.
• Opportunity costs in the game of best choice
• Sum the odds to one and stop
• Full-information best choice game with hint
• Hint, extortion, and guessing games in the best choice problem
• A new look at the returning secretary problem
• A new secretary problem with rank-based selection and cardinal payoffs
• Optimal selection based on relative rank (the 'Secretary Problem')
• Differential equations and optimal choice problems
• On a class of secretary problems
• A multi-attribute extension of the secretary problem: theory and experiments
• A time-dependent best choice problem with costs and random lifetime in organ transplants
• NON-NULL RANKING MODELS. I
• A rank-based selection with cardinal payoffs and a cost of choice
• The Secretary Problem and Its Extensions: A Review
• A secretary problem with uncertain employment
• Interview Costs in the Secretary Problem
• Duration of a secretary problem
• Selecting a sequence of last successes in independent trials
• Exact results for a secretary problem
• On Asymptotic Properties of Optimal Stopping Time
• The postdoc variant of the secretary problem
• Average number of candidates surveyed by the headhunter in the recruitment
• The Sum-the-Odds Theorem with Application to a Stopping Game of Sakaguchi
• New developments of the odds theorem
• Optimal Stopping Rules

This page was built for publication: Sequential selections with minimization of failure