CAREER: Next Generation Online Resource Allocation

职业：下一代在线资源分配

• 批准号: 2340306
• 负责人: Rajan Udwani
• 金额: $ 56.22万
• 依托单位: University of California-Berkeley
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2024
• 资助国家: 美国
• 起止时间: 2024-07-01 至 2029-06-30
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2340306&HistoricalAwards=false
• 关键词: CAREER; Next; Generation; Online; Resource

This Faculty Early Career Development Program (CAREER) grant will contribute to the advancement of national prosperity and economic welfare by supporting research to study new models and algorithms for dynamic allocation of resources. This work will develop novel, practical algorithmic solutions that can accommodate the complex features, objectives, and constraints arising in applications such as shared mobility, battery swapping for electric vehicles and online advertising. The research will (i) systematic algorithmic insights leading to practical implementations and more robust online platforms; (ii) identify and exploit connections between online resource allocation problems and other areas such as queueing theory, and (iii) enable discovery of new methods for analyzing online algorithms. The accompanying educational plan aims to broaden STEM interest and to provide opportunities for underrepresented communities by training community college instructors on topics related to online resource allocation and operations engineering and collaboratively developing interactive learning modules for community college courses.The research supported by this award will formulate the next generation of models for modern online resource allocation environments and design intuitive algorithms for their solution, emphasizing scalability to large problem instances and the best possible theoretical performance guarantees. This will be accomplished by identifying general structural properties that lead to algorithms that are broadly applicable and robust to changing environments. A major technical emphasis will be on developing methods to analyze adaptive online algorithms that can react to realization of stochastic uncertainties in the problem instance. Adaptive algorithms typically have the best practical performance, but their theoretical analysis is challenging and poorly understood except in some specific settings. Results will include worst case performance bounds and numerical experiments comparing the proposed algorithms with state-of-the-art approaches.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

该教师早期职业发展计划（CAREER）赠款将通过支持研究资源动态分配的新模型和算法，为促进国家繁荣和经济福利做出贡献。这项工作将开发新颖、实用的算法解决方案，以适应共享出行、电动汽车电池更换和在线广告等应用中出现的复杂特征、目标和约束。该研究将（i）系统化的算法见解，带来实际的实施和更强大的在线平台； (ii) 识别和利用在线资源分配问题与排队论等其他领域之间的联系，以及 (iii) 能够发现分析在线算法的新方法。随附的教育计划旨在通过培训社区大学教师有关在线资源分配和运营工程的主题以及合作开发社区大学课程的互动学习模块，扩大 STEM 兴趣并为代表性不足的社区提供机会。该奖项支持的研究将制定现代在线资源分配环境的下一代模型，并为其解决方案设计直观的算法，强调大型问题实例的可扩展性和最佳的理论性能保证。这将通过识别一般结构属性来实现，这些属性导致算法广泛适用且对不断变化的环境具有鲁棒性。主要技术重点将是开发分析自适应在线算法的方法，这些算法可以对问题实例中随机不确定性的实现做出反应。自适应算法通常具有最佳的实际性能，但其理论分析具有挑战性，并且除了某些特定设置外，人们对其了解甚少。结果将包括最坏情况下的性能界限以及将所提出的算法与最先进的方法进行比较的数值实验。该奖项反映了 NSF 的法定使命，并通过使用基金会的智力优点和更广泛的影响审查标准进行评估，被认为值得支持。