Secretary Problem: Graphs, Matroids and Greedoids

Wojciech Kordecki ()
Additional contact information
Wojciech Kordecki: The Witelon State University of Applied Sciences in Legnica

SN Operations Research Forum, 2021, vol. 2, issue 4, 1-19

Abstract: Abstract 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 previously rejected elements. The independence 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. Applications in cloud computing are discussed.

Keywords: sekretary problem; discrete structure; indenpendence; cloud computing (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s43069-021-00092-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:snopef:v:2:y:2021:i:4:d:10.1007_s43069-021-00092-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-021-00092-x

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().