Showing 1 - 10 of 10,173
A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b is bigger than or equal to 1 is a preassigned number. It is...
Persistent link: https://www.econbiz.de/10011381898
Persistent link: https://www.econbiz.de/10009792087
Persistent link: https://www.econbiz.de/10010338557
Persistent link: https://www.econbiz.de/10010345216
Persistent link: https://www.econbiz.de/10010403067
Persistent link: https://www.econbiz.de/10010492970
Persistent link: https://www.econbiz.de/10010461866
Persistent link: https://www.econbiz.de/10012582192
Persistent link: https://www.econbiz.de/10012395660
Persistent link: https://www.econbiz.de/10011672913