We consider a full information best-choice problem where an administrator who has only one on-line choice in m consecutive searches has to choose the best candidate in one of them.
科研之友
微信
新浪微博
Facebook
分享链接
