课题基金 / 基金详情

Collaborative Research: AF: Medium: Modern Combinatorial Optimization: Incentives, Uncertainty, and Smoothed Analysis

Collaborative Research: AF: Medium: Modern Combinatorial Optimization: Incentives, Uncertainty, and Smoothed Analysis
合作研究:AF:中:现代组合优化:激励、不确定性和平滑分析
批准号:
1954927
负责人:
Aviad Rubinstein
金额:
$59.79万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2020
资助国家:
美国
项目状态:
未结题
起止时间:
2020-07-01 至 2025-06-30

项目摘要

项目成果

Aviad Rubinstein的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
Optimization theory is a central facet of computer science, and has driven the theoretical foundations since its inception. The classical paradigm considers a decision maker with all the relevant information available, and algorithms are evaluated primarily on the quality of the solution produced and the speed with which the solution is found. In modern applications, however, the decision maker no longer has all the relevant information in advance. Perhaps they must instead incentivize strategic agents to reveal this information, even when these agents have their own interests in the solution produced. Perhaps they must instead learn the relevant information in pieces online, making irrevocable decisions along the way with only partial information. The overarching theme of this project is the development of novel optimization theory subject to these modern constraints.In more detail, this project considers three key angles. First, it considers the interaction between multi-item auctions and communication complexity. For example, it aims to understand whether or not any communication-efficient optimization algorithm, designed without incentives in mind, can be made to also accommodate agents’ incentives without (much) loss in performance. Second, it revisits the classical problem of submodular maximization subject to a cardinality constraint (which is known to be intractable on worst case inputs), and introduces a novel variant of smoothed analysis for this problem. Finally, it proposes a new approach towards the still-open Matroid Secretary Problem: a generalization of the Minimum Spanning Tree problem where edges are learned one at a time and must be irrevocably included (or not) in the spanning tree before seeing other edges.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.
期刊论文(3)
专著(0)
科研奖励(0)
会议论文
DOI: 10.4230/lipics.itcs.2022.113
发表时间: 2021-02
期刊: ArXiv
影响因子: --
作者: [A. Rubinstein;Junyao Zhao]
通讯作者: A. Rubinstein;Junyao Zhao
DOI: --
发表时间: 2020-12
期刊: ArXiv
影响因子: --
作者: [Aranyak Mehta;Alexandros Psomas]
通讯作者: Aranyak Mehta;Alexandros Psomas
DOI: 10.1145/3406325.3451111
发表时间: 2021
期刊: STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
影响因子: --
作者: [Rubinstein, Aviad, Zhao, Junyao]
通讯作者: Zhao, Junyao
CAREER: Distances and matchings under the lens of fine-grained complexity
  • 批准号:
    2337901
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $64.6万
  • 财政年份:
    2024
  • 负责人:
    Aviad Rubinstein
  • 依托单位:
NSF-BSF: AF: Small: Algorithmic Game Theory: Equilibria and Beyond
  • 批准号:
    2112824
  • 项目类别:
    Standard Grant
  • 资助金额:
    $50.0万
  • 财政年份:
    2021
  • 负责人:
    Aviad Rubinstein
  • 依托单位:
国内基金
海外基金
Research on Quantum Field Theory without a Lagrangian Description
  • 批准号:
    24ZR1403900
  • 项目类别:
    省市级项目
  • 资助金额:
    --
  • 批准年份:
    2024
  • 负责人:
    SATOSHI NAWATA
  • 依托单位:
Cell Research
Cell Research
Cell Research (细胞研究)