MIXED-TYPE SECRETARY PROBLEMS ON SEQUENCES OF BIVARIATE RANDOM VARIABLES

この論文をさがす

説明

An employer interviews a finite number n of applicants for a position. They are interviewed one by one sequentially in random order. as each applicant i is interviewed, two attributes are evaluated by the amounts X_i and Y_i, where X_i may be "talent" (or quality), and Y_i may be the "look" (or degree of favorable impression) of the appplicant. Suppose that {X_i}^n_<i=1>, ({Y_i}^n_<i=1) is under the condition of full (no) -information secretary problem and that X_i's and Y_i's are mutually independent. We consider the three kinds of the employer's object and for each of three cases the problem is formulated by dymanic programming, and the optimal policy is explicy is explicitly derived.

収録刊行物

詳細情報 詳細情報について

  • CRID
    1570572702502846080
  • NII論文ID
    110003481054
  • NII書誌ID
    AN00351206
  • 本文言語コード
    en
  • データソース種別
    • CiNii Articles

問題の指摘

ページトップへ