Geodesic
Full-information best-choice game with two stops
Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 1 (2009) no. 3, pp. 31-45

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider a full-information best-choice game in which each player wants to hire two secretaries. The aim of a player is to maximize the sum of expected applicant' quality values. Two models are considered: m-person best-choice game with the possibility of an applicant refusing an offer and two-person best-choice game with dominant player. The optimal strategies are received. We prove that in the best-choice game with the possibility of an applicant refusing an offer the players' payoffs don't depend on total number of players in the game.
Keywords: best-choice game, optimal strategy, multistage game, multiple stopping. 
@article{MGTA_2009_1_3_a2,
     author = {Anna Ivashko},
     title = {Full-information best-choice game with two stops},
     journal = {Matemati\v{c}eska\^a teori\^a igr i e\"e prilo\v{z}eni\^a},
     pages = {31--45},
     publisher = {mathdoc},
     volume = {1},
     number = {3},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MGTA_2009_1_3_a2/}
}
TY  - JOUR
AU  - Anna Ivashko
TI  - Full-information best-choice game with two stops
JO  - Matematičeskaâ teoriâ igr i eë priloženiâ
PY  - 2009
SP  - 31
EP  - 45
VL  - 1
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MGTA_2009_1_3_a2/
LA  - ru
ID  - MGTA_2009_1_3_a2
ER  - 
%0 Journal Article
%A Anna Ivashko
%T Full-information best-choice game with two stops
%J Matematičeskaâ teoriâ igr i eë priloženiâ
%D 2009
%P 31-45
%V 1
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MGTA_2009_1_3_a2/
%G ru
%F MGTA_2009_1_3_a2
Anna Ivashko. Full-information best-choice game with two stops. Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 1 (2009) no. 3, pp. 31-45. http://geodesic.mathdoc.fr/item/MGTA_2009_1_3_a2/