Differences

This shows you the differences between two versions of the page.

--- seminars:stat:191205 [2019/12/01 19:48] – qyu
+++ seminars:stat:191205 [2019/12/01 19:49] (current) – qyu
@@ Line 1: / Line 1: @@
+<WRAP centeralign>##Statistics Seminar##\\ Department of Mathematical Sciences</WRAP>
+<WRAP 70% center>
+^  **DATE:**|Thursday, December 5, 2019 |
+^  **TIME:**|1:15pm -- 2:15pm |
+^  **LOCATION:**|WH 100E |
+^  **SPEAKER:**|Shaofei Zhao, Binghamton  University |
+^  **TITLE:**|Job search problem and its extension.  |
+</WRAP>
+\\
+<WRAP center box 80%>
+<WRAP centeralign>**Abstract**</WRAP>
+Job search problem, or the secretary problem is one application
+of the optimal stopping problem, and the optimal stopping strategy is for a
+given sample size n, we pass over the first k offers, and stop at the first
+offer which is better than all the preceding ones. Here k/n is
+approximately 1/e. However in reality we don't always know the sample size
+in advance, but can assume it's a random variable follows certain
+distribution. We find the optimal stopping strategy in this situation.
+</WRAP>