1. Bateni MH, Hajiaghayi M, Zadimoghaddam M (2013) Submodular secretary problem and extensions. ACM Trans Algorithms 9(4):1–23
2. Brualdi RA (1969) Comments on bases in dependence structures. Bull Aust Math Soc 1(2):161–167
3. Chambers CP, Echenique F (2016) Revealed preference theory. Cambridge University Press, England
4. Chen Y, Hassani SH, Karbasi A (2015) Sequential information maximization: when is greedy near-optimal? In: Proceedings of The 28th Conference on Learning Theory, pp. 338-363. Paris, France
5. Das A, Kempe D (2018) Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection. J Mach Learn Res 19(1):74–107