Dynamic programming and the secretary problem (Q918875): Difference between revisions

A simple dynamic program is formulated and solved for the secretary problem in which one seeks to maximize the probability of hiring the best of N candidates who are interviewed in succession and who must be accepted or rejected at the interview. Numerical results for small N are given.

0 references

Mathematics Subject Classification ID

90C39

0 references

0 references

0 references

0 references

secretary problem

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Q5653410

0 references

Finite state Markovian decision processes

0 references

Q3022029

0 references

Dynamic Programming and Decision Theory

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:918875

@@ Property / author @@
-Martin J. Beckmann
@@ Property / author: Martin J. Beckmann / rank @@
-Normal rank
@@ Property / reviewed by @@
-Howard J. Weiner
@@ Property / reviewed by: Howard J. Weiner / rank @@
-Normal rank
@@ Property / author @@
+Martin J. Beckmann
@@ Property / author: Martin J. Beckmann / rank @@
+Normal rank
@@ Property / reviewed by @@
+Howard J. Weiner
@@ Property / reviewed by: Howard J. Weiner / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5653410
@@ Property / cites work: Q5653410 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite state Markovian decision processes
@@ Property / cites work: Finite state Markovian decision processes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3022029
@@ Property / cites work: Q3022029 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Decision Theory
@@ Property / cites work: Dynamic Programming and Decision Theory / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:918875