Stochastic Resource Allocation Problems: Minmax and Maxmin Solutions

• 成果类型: Article
• 署名作者: Ninh, Anh; Shen, Zuo-. Tun Max
• 署名单位: University of California System; University of California Berkeley; University of California System; University of California Berkeley
• 刊物名称: M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT
• ISSN/ISSBN: 1523-4614
• DOI: 10.1287/msom.2022.0550
• 发表日期: 2024
• 关键词: stochastic allocation; order statistics; log-concave; clinical trials; RECRUITMENT

摘要

Problem definition: Min-max or max-min objective criteria naturally arise in many resource allocation applications, especially when the attendant goal involves distribution of a limited resource across multiple subsystems, locations, or activities. Each has a different consumption rate of the resource. In this setting, the decision maker is interested in optimizing the system performance, which can be measured in terms of the smallest or largest order statistic across subsystems. Examples include the allocation of health resources to maximize the first runout time or to minimize the maximum delay. Methodology/results: In the literature, there are no unified theoretical and computational results on the optimal allocations for these problems. Thus, in this paper, we develop key theoretical properties of the attendant stochastic resource allocation problems, providing a technical condition for the objective functions to have favorable properties, upon which we derive novel optimal allocation rules with clear interpretation. Managerial implications: The proportional allocation rule can be interpreted as a robust solution when the full distribution of the interarrival time is unknown. It generally has poor performance, especially when the resource consumption rates vary across locations, which happens regularly in practice. Our allocation rule is exact and should be used for the allocation of scarce resources-that is, when the number of resources per location is limited, which is often encountered in healthcare settings.