Post your project for free and start receiving proposals from freelancers within minutes after publication!
Task of the Bride on Python
67 USD 
You need to write a program on Python, which solves the stochastic version of the task about the bride.Conditions of task:
1 .There is a fixed and known number of n candidates for one position, which can be placed in quality order.2ndThe applicants are considered consistently in a random order.ThreeFor each applicant, j DM (decision maker) can only know the relative ranking of the applicant, i.e. how valuable it is compared to j-1 previously considered applicants.4 .The rejected candidate cannot be returned.If the applicant reaches n, it must be accepted.5 .DM receives a pi(a) reward for the choice of a candidate with a absolute ranking where pi(1) >=...>=pi(n).The optimal strategy is that the DM should intervene with the first t_1 - 1 candidates and throw out all, then between the t_1 candidate and the t_2 candidate - 1 it should only accept candidates with the relative rank 1 (the best of the met); between the t_2 candidate and the t_3 candidate - 1 it should accept candidates with the relative rank 1 or 2; and so on.That is, we set the limits t_1=
1 .There is a fixed and known number of n candidates for one position, which can be placed in quality order.2ndThe applicants are considered consistently in a random order.ThreeFor each applicant, j DM (decision maker) can only know the relative ranking of the applicant, i.e. how valuable it is compared to j-1 previously considered applicants.4 .The rejected candidate cannot be returned.If the applicant reaches n, it must be accepted.5 .DM receives a pi(a) reward for the choice of a candidate with a absolute ranking where pi(1) >=...>=pi(n).The optimal strategy is that the DM should intervene with the first t_1 - 1 candidates and throw out all, then between the t_1 candidate and the t_2 candidate - 1 it should only accept candidates with the relative rank 1 (the best of the met); between the t_2 candidate and the t_3 candidate - 1 it should accept candidates with the relative rank 1 or 2; and so on.That is, we set the limits t_1=
Applications 1
Application viewing is only available registered users.
Kyiv