Showing 1 - 10 of 566
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/10011313165
Persistent link: https://www.econbiz.de/10009751191
Persistent link: https://www.econbiz.de/10009751534
Persistent link: https://www.econbiz.de/10009760418
Persistent link: https://www.econbiz.de/10010381847
Persistent link: https://www.econbiz.de/10010194833
Persistent link: https://www.econbiz.de/10010349363
Persistent link: https://www.econbiz.de/10010256230
Persistent link: https://www.econbiz.de/10011485624