2018-05-04

Hiring Problem,it is also known as the Secretary Problem,we use the wikipedia definiton to define it.

**The basic form of the problem is the follwinng:imagine an administrator who wants to hire the best secretary out of
rankable applicants for a position.The applicants are interviewd one by one in random order.A decision about each particular appliant is to be made immediately after the interview.Once rejectd,an applicant cannot be recalled.During the interview,the administrator can rank the applicant among all interviewd so farm,but is unaware of the quailty of yet unseen applicants.**

The question is about the optimal strategy to maximize the probability of selecting the best applicant.

If the decison can be deferred to the end,this can be solved by the simple maximum selection algotithm of traking the running maximum,and selecting the overall maximum at the end.The difficulty is that the decision must be made immediately.

The probability of win using is:

Our idea is we choose r which we can use the first element better than it,than we think the element is best chioce.So,now we have a question,if the turly best element is before K,we can not find the best,the probability is 0,if not,we have:

Now we can make:

Let ,and we can get .

Now we find the max value of this function,we have:

So,now we know the ,and the probability that we find the max of is .

I will give its solution in next paper.i am tried now,zZZ.

1,Chapter 2. FINITE HORIZON PROBLEMS.

- 四月初雨
- 当空
- “只”字于书法碑帖
- 白马青牛还杀了一只鸡
- 怯
- When The Music Stops,Silence and Fury
- The mathematical principle of Hiring Problem
- 读《一个游荡者的世界》中几文感
- Something in Fourier Analysis
- 赏花归去马如飞--关乎回文
- 黄金与白银
- 像是水融入了水
- 随机过程中一些基础定理的数学推导
- 欧几里得算法实现与最大公约数算法研究
- 交换群在几何与组合中的应用
- 基于分析角度的微积分体系的搭建
- 对歌词的解构与更改
- The Mathematical Basis Of Convex Optimization
- 对于Gobang近期棋局的总结
- 雪融
- 管中窥豹无字书--四年记
- RSA算法的原理，Cpp语言实现与应用
- 对于调和级数与P-级数收敛性的证明
- 吉米多维奇中一道三角函数求和题目
- 读黄克孙译《鲁拜集》中几诗感