When to stop -- a cardinal secretary search experiment

DOI10.1016/J.JMP.2020.102425zbMath1455.91073OpenAlexW2796835868MaRDI QIDQ826903

Andrej Angelovski, Güth, Werner

Publication date: 6 January 2021

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

Full work available at URL: http://economiaefinanza.luiss.it/sites/economiaefinanza.luiss.it/files/1706_0.pdf

zbMATH Keywords

optimal stoppingsecretary problembehavioral ORsequential search mechanism

Mathematics Subject Classification ID

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

Related Items (1)

Sequential selections with minimization of failure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic programming of some sequential sampling design
• Who solved the secretary problem
• Analysis of heuristic solutions to the best choice problem.
• Good news and bad news: Search from unknown wage offer distributions
• (Sub) optimality and (non) optimal satisficing in risky decision experiments
• A new secretary problem with rank-based selection and cardinal payoffs
• The analytic invariants of an area-preserving mapping near a hyperbolic fixed point
• A rank-based selection with cardinal payoffs and a cost of choice
• The Secretary Problem and Its Extensions: A Review
• The Best Choice Problem for a Random Number of Objects
• BASIC THEORY OF SELECTION BY RELATIVE RANK WITH COST

This page was built for publication: When to stop -- a cardinal secretary search experiment