MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A multiple secretary problem with switch costs

Author(s)
Ding, Jiachuan
Thumbnail
DownloadFull printable version (4.258Mb)
Other Contributors
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Advisor
Dan Ariely.
Terms of use
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
Metadata
Show full item record
Abstract
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.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2007.
 
Includes bibliographical references (p. 76).
 
Date issued
2007
URI
http://hdl.handle.net/1721.1/41735
Department
Massachusetts Institute of Technology. Computation for Design and Optimization Program
Publisher
Massachusetts Institute of Technology
Keywords
Computation for Design and Optimization Program.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.