A markov chain version of the secretary problem (Q4124634): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1002/nav.3800230114 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/nav.3800230114 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2036386642 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1002/NAV.3800230114 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:14, 29 December 2024
scientific article; zbMATH DE number 3550495
Language | Label | Description | Also known as |
---|---|---|---|
English | A markov chain version of the secretary problem |
scientific article; zbMATH DE number 3550495 |
Statements
A markov chain version of the secretary problem (English)
0 references
1976
0 references