Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2007. / Includes bibliographical references (p. 76). / In this thesis, we utilize probabilistic reasoning and simulation methods to determine the optimal selection rule for the secretary problem with switch costs, in which a known number of applicants appear sequentially in a random order, and the objective is to maximize the sum of the qualities of all hired secretaries over all time. It is assumed that the quality of each applicant is uniformly distributed and any hired secretary can be replaced by a better qualified one at a constant switch cost. A dynamic program is formulated and the optimal selection rule for the single secretary case is solved. An approximate solution is given for the multiple secretary case, in which we are allowed to have more than one secretary at a time. An experiment was designed to simulate the interview process, in which respondents were sequentially faced with random numbers that represent the qualities of different applicants. Finally, the experimental results are compared against the optimal selection strategy. / by Jiachuan Ding. / S.M.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/41735 |
| Date | January 2007 |
| Creators | Ding, Jiachuan |
| Contributors | Dan Ariely., Massachusetts Institute of Technology. Computation for Design and Optimization Program., Massachusetts Institute of Technology. Computation for Design and Optimization Program. |
| Publisher | Massachusetts Institute of Technology |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | 76 p., application/pdf |
| Rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission., http://dspace.mit.edu/handle/1721.1/7582 |
Page generated in 0.0016 seconds