| Autor: |
Kordecki, Wojciech |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
Operations Research Forum 2(4) 2021 |
| Druh dokumentu: |
Working Paper |
| DOI: |
10.1007/s43069-021-00092-x |
| Popis: |
In the paper the generalisation of the well known "secretary problem" is considered. The aim of the paper is to give a generalised model in such a way that the chosen set of the possible best $k$ elements have to be independent of all rejected elements. This condition is formulated using the theory of greedoids and in their special cases -- matroids and antimatroids. Examples of some special cases of greedoids (uniform, graphical matroids and binary trees) are considered. |
| Databáze: |
arXiv |
| Externí odkaz: |
|
