### The Secretary Experiment

|        |        |        |        |        |        |        |        |        |         |         |         |         |         |         |         |         |         |         |         |         |         |         |         |         |
|--------|--------|--------|--------|--------|--------|--------|--------|--------|---------|---------|---------|---------|---------|---------|---------|---------|---------|---------|---------|---------|---------|---------|---------|---------|
| Ball 1 | Ball 2 | Ball 3 | Ball 4 | Ball 5 | Ball 6 | Ball 7 | Ball 8 | Ball 9 | Ball 10 | Ball 11 | Ball 12 | Ball 13 | Ball 14 | Ball 15 | Ball 16 | Ball 17 | Ball 18 | Ball 19 | Ball 20 | Ball 21 | Ball 22 | Ball 23 | Ball 24 | Ball 25 |
| Ball 1 | Ball 2 | Ball 3 | Ball 4 | Ball 5 | Ball 6 | Ball 7 | Ball 8 | Ball 9 | Ball 10 | Ball 11 | Ball 12 | Ball 13 | Ball 14 | Ball 15 | Ball 16 | Ball 17 | Ball 18 | Ball 19 | Ball 20 | Ball 21 | Ball 22 | Ball 23 | Ball 24 | Ball 25 |
Distribution graph

#### Description

In the secretary problem, there are $$n$$ candidates, totally ranked from best to worst, with no ties. The candidates arrive sequentially, in random order. We can not observe the absolute ranks of the candidates as they arrive, only the relative ranks. Our goal is to choose the best candidate; any other outcome is failure.

In the secretary experiment, the candidates are represented as balls. For $$k \in \{1, 2, \ldots, n\}$$ strategy $$k$$ is to let the first $$k - 1$$ candidates go by, and then pick the first candidate (if she exists) who is better than all previous candidates. If this candidate does not exist, we must pick the last candidate (regardless of rank). The first row of balls shows the relative ranks of the candidates, up to the candidate that is selected. The second row of balls shows all candidates with their absolute ranks. On each run, the number (arrival order) of the selected candidate $$X$$, the number of the best candidate $$Y$$, and the indicator variable of a win $$W$$ are recorded. The number of candidates $$n$$ and the strategy parameter $$k$$ can be varied with input controls.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 9, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8526157140731812, "perplexity_flag": "middle"}