Selection by committee in the best choice problem with rank criterion

Host Institution:

University of Technology, Sydney

Title of Seminar:

Selection by committee in the best choice problem with rank criterion

Speaker's Name:

Professor Vladimir Mazalov

Speaker's Institution:

Institute of Applied Mathematical Research, Petrozavodsk, Russia

Time and Date:

Thursday September 18, 3.00PM

Seminar Abstract:

Imagine that a voting committee which presented by $m$ person (players) has the objective to invite a specialist for the position.
There are $n$ applicants for this position. All candidates have different priorities (ranks) for each player in respect of professional qualities of the candidates  (i.e. foreign language, computer ability, etc. ).
Candidate $i$ with rank $i<j$ is better than $j$.
The candidates arrive in random order and all $n!$ permutation of the candidates are equally likely.
In each stage every player knows the relative rank of the candidate in respect of the previous visitors.
Relative ranks of different players are independent.
Each player aims to minimize the expected payoff they can get.
For the case with $m=2$ players we use the lottery and for m >3 we use the voting procedure.
The optimal strategies of players are derived.

Seminar Convenor:

This email address is being protected from spambots. You need JavaScript enabled to view it.

AGR IT support:

This email address is being protected from spambots. You need JavaScript enabled to view it.