The Job-search Problem with Incomplete Information | Zendy

Vladimir V. Mazalov | Zendy; Elena Konovalchikova | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Job-search Problem with Incomplete Information

Author(s) -

Vladimir V. Mazalov,

Elena Konovalchikova

Publication year - 2015

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2015.07.025

Subject(s) - computer science , quality (philosophy) , sequence (biology) , adversary , independent and identically distributed random variables , object (grammar) , complete information , component (thermodynamics) , artificial intelligence , random variable , mathematical economics , mathematics , computer security , statistics , philosophy , genetics , physics , epistemology , biology , thermodynamics

This paper considers a best-choice game with incomplete information associated with the job search problem. Players (experts) observe a sequence of independent identically distributed random variables (xi, yi), i = 1. . ., n, which represent the quality of incoming objects. The first component is announced to the players and the other one is hidden. The players choose an object based on known information about it. The winner is the player having a higher sum of the quality components (total quality) than the opponent. And finally, the optimal strategies of the players are derived

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research