Last Name :  
Member ID :  
Password :
Forgot Password?
  You are logged in as Guest Home Contact Us Tech Support ETocS My Journal/Searches Help
  INFORMS Homepage
  Editor-in-Chief Homepage
  Society link
  PubsOnLine - Library Access
  INFORMS Publications
  Copyright and Permissions
   
  Journals
Decision Analysis
Information Systems Research
INFORMS Journal on Computing
Interfaces
Management Science
Manufacturing and Service Operations Management
Marketing Science
Mathematics of Operations Research
Operations Research
Organization Science
Transportation Science
International Abstracts in Operations Research
  Electronic Journal
INFORMS Transactions on Education
  Membership Magazines
OR/MS Today
Analytics
OR/MS Tomorrow
  Request for Subscription
   




 
 
 
 

Operations Research
 
     
  Volume Number 55   Issue Number 5   First Page 921   Last Page 931   Cover Date October 01, 2007

 
 
 
Email to a friend

Add to Favorites

Full Text

Abstract PDF
 
 
     
  Optimal Expected Rank in a Two-Sided Secretary Problem
Kimmo Eriksson, Jonas Sjöstrand, Pontus Strimling
 
  In a two-sided version of the famous secretary problem, employers search for a secretary at the same time as secretaries search for an employer. Nobody accepts being put on hold, and nobody is willing to take part in more than N interviews. Preferences are independent, and agents seek to optimize the expected rank of the partner they obtain among the N potential partners. We find that in any subgame perfect equilibrium, the expected rank grows as the square root of N (whereas it tends to a constant in the original secretary problem). We also compute how much agents can gain by cooperation.  
   

   
   
   
     
  Featured Sites
 
 
Copyright © Informs 2008. All rights reserved.