Generalized Sequential Stochastic Assignment Problem

References

• Albright SC (1974) Optimal sequential assignment with random arrival time. Management Sci. 21(1):60–67.Link, Google Scholar
• Albright SC, Derman C (1972) Asymptotic optimal policies for stochastic sequential assignment problem. Management Sci. 19(1):46–51.Link, Google Scholar
• Babaioff M, Dinitz M, Gupta A, Immorlica N, Talwar K (2009) Secretary problems: Weights and discounts. Proc. 20th Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’09 (Society for Industrial and Applied Mathematics, Philadelphia), 1245–1254.Google Scholar
• Buchbinder N, Jain K, Singh M (2013) Secretary problems via linear programming. Math. Oper. Res. 39(1):190–206.Google Scholar
• Chow YS, Moriguti S, Robbins H, Samuels SM (1964) Optimal selection based on relative rank. Israel J. Math. 2(2):81–90.Google Scholar
• Derman C, Lieberman GJ, Ross SM (1972) A sequential stochastic assignment problem. Management Sci. 18(7):349–355.Link, Google Scholar
• Enns EG (1970) The optimum strategy for choosing the maximum of n independent random variables. Unternehmensforschung 14(1):89–96.Google Scholar
• Freeman PR (1983) The secretary problem and its extensions: A review. Internat. Statist. Rev. 51(2):189–206.Google Scholar
• Gershkov A, Moldovanum B (2010) Efficient sequential assignment with incomplete information. Games Econom. Behav. 68(1):144–154.Google Scholar
• Gianini J, Samuels SM (1976) The infinite secretary problem. Ann. Probab. 4(3):418–432.Google Scholar
• Glasser KS, Holzsager R (1983) The d choice secretary problem. Comm. Statist. 2(3):177–199.Google Scholar
• Goel G, Nikzad A, Singla A (2014) Allocating tasks to workers with matching constraints: Truthful mechanisms for crowdsourcing markets. Proc. 23rd Internat. Conf. World Wide Web (ACM, New York), 279–280.Google Scholar
• Kennedy DP (1986) Optimal sequential assignment. Math. Oper. Res. 11(4):619–626.Link, Google Scholar
• Khatibi A, Jacobson SH (2014) Doubly stochastic sequential assignment problem. Naval Res. Logist. 63(2):124–137.Google Scholar
• Khatibi A, Baharian G, Kone ER, Jacobson SH (2014) The sequential stochastic assignment problem with random success rates. IIE Trans. 46(11):1169–1180.Google Scholar
• Kleinberg R (2005) A multiple-choice secretary algorithm with applications to online auctions. Proc. 16th Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’05 (Society for Industrial and Applied Mathematics, Philadelphia), 630–631.Google Scholar
• Lindley DV (1961) Dynamic programming and decision theory. Appl. Statist. 10(1):39.Google Scholar
• Nikolaev AG, Jacobson SH (2010) Stochastic sequential decision-making with a random number of jobs. Oper. Res. 58(4P1):1023–1027.Abstract, Google Scholar
• Oveis Gharan S, Vondrák J (2011) On variants of the matroid secretary problem. Demetrescu C, Halldórsson MM, eds. Algorithms – ESA 2011. Lecture Notes in Computer Science, vol. 6942 (Springer, Berlin, Heidelberg), 335–346.Google Scholar
• Presman EL, Sonin IM (1972) The best choice problem for a random number of objects. Theory Probab. Appl. 17(4):657–668.Google Scholar
• Rasmussen WT, Pliska SR (1975) Choosing the maximum from a sequence with a discount function. Appl. Math. Optim. 2(3):279–289.Google Scholar
• Sakaguchi M (1978) Dowry problems and ola policies. Rep. Statist. Appl. Res. JUSE 25:124–128.Google Scholar
• Smith MH (1975) A secretary problem with uncertain employment. J. Appl. Probab. 12(03):620–624.Google Scholar
• Su X, Zenios SA (2005) Patient choice in kidney allocation: A sequential stochastic assignment model. Oper. Res. 53(3):443–455.Link, Google Scholar