Secretary problem: graphs, matroids and greedoids
From MaRDI portal
Publication:2068844
DOI10.1007/s43069-021-00092-xzbMath1481.91064arXiv1801.00814OpenAlexW3215544844MaRDI QIDQ2068844
Publication date: 20 January 2022
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.00814
Decision theory (91B06) Applications of graph theory (05C90) Stopping times; optimal stopping problems; gambling theory (60G40) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural properties of greedoids
- Greedoids
- Who solved the secretary problem
- Partial-order analogue of the secretary problem: The binary tree case
- Random Graphs and Complex Networks
- Matroid Secretary Problem in the Random-Assignment Model
- The secretary problem on an unknown poset
- Matroid Secretary Problems
- Combinatorial optimization. Theory and algorithms.