The secretary problem with a hazard rate condition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5385 LNCS, Issue , 2008, Pages 708-715

  Mahdian, Mohammad ^a   McAfee, Randolph Preston ^a   Pennock, David ^a  

^a YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET; WIMAX (CANDIDATE); WINE;

EXPONENTIAL DISTRIBUTIONS; HAZARD RATES; MAXIMUM VALUES; OPTIMAL SAMPLINGS; SECRETARY PROBLEMS; SMALL SAMPLES;

PROBABILITY DISTRIBUTIONS;

EID: 58849099982     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92185-1_76     Document Type: Conference Paper

References (8)

1. Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. In: ACM SIGecom Exchanges (to appear)
2. Dynkin, E.B.: The optimal choice of the stopping moment for a markov process. Dokl. Akad. Nauk. SSSR 150, 238-240 (1963)
3. Ferguson, T.S.: Who solved the secretary problem? Statistical Science 4(3), 282-289 (1989)
4. Freeman, P.R.: The secretary problem and its extensions: A review. International Statistical Review 51, 189-206 (1983)
5. Gardner, M.: Scientific American (February/March 1960)
6. Kingman, J.F.C.: Uses of exchangeability. Annals of Probability 6, 183-197 (1978)
7. Mahdian, M., McAfee, R.P., Pennock, D.: Secretary problem with durable employment. Working paper (2008)
8. McAfee, R.P., McMillan, J.: Auctions and bidding. Journal of Economic Literature 25(2), 699-738 (1987)