Abstract
AbstractIn 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.
Publisher
Springer Science and Business Media LLC
Reference25 articles.
1. Babaioff M, Immorlica N, Kempe D, Kleinberg R (2008) Online auctions and generalized secretary problems. SIGecom Exch 7 (2): 7:1–7:11. ISSN 1551-9031. 10.1145/1399589.1399596. https://doi.org/10.1145/1399589.1399596
2. Babaioff M, Immorlica N, Kleinberg R (2018) Matroid secretary problems. J ACM 65 (6): 35:1–35:26
3. Bollobás B (2001) Random Graphs. Academic Press, London
4. Dai H, Yang Y, Yin JS, Jiang H, Li C (2019) Improved greedy strategy for cloud computing resources scheduling. ICIC Express Lett 13(6):499–504. http://www.icicel.org/ell/contents/2019/6/el-13-06-09.pdf
5. Dai Y-S Yang B, Dongarra J, Zhang G (2009) Cloud service reliability: Modeling and analysis. In 15th IEEE Pacific Rim Intern Symp Depend Comput. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.214.143&rep=rep1&type=pdf
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献