课题基金 / 基金详情

RI: Small: New Computational Techniques and Market Designs for Kidney Exchanges and Other Barter Markets

RI: Small: New Computational Techniques and Market Designs for Kidney Exchanges and Other Barter Markets
RI:小型:肾脏交换和其他易货市场的新计算技术和市场设计
批准号:
1718457
负责人:
Tuomas Sandholm
金额:
$42.0万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2017
资助国家:
美国
项目状态:
已结题
起止时间:
2017-09-01 至 2021-08-31

项目摘要

项目成果

Tuomas Sandholm的其他基金

相似基金

相关文献

中文摘要
翻译
仅在美国,每年就有3.5万名晚期肾病患者被添加到已故捐赠者等待名单中,10万人在等待肾脏移植--比所有其他实体器官移植的总和还要多。这一需求远远超过了已故捐赠者肾脏的供应。活着的人可以捐献肾脏,但由于血型和组织类型不相容,给定的捐赠者不太可能捐赠给给定的患者。这为肾脏交换打开了大门,这样愿意的捐赠者和患者配对就可以“交换”捐赠者。在现代肾脏交换中,这些“交换”是通过循环和利他捐赠者发起的链条进行的。之前在开发肾脏交换的方法、算法和软件方面的工作已经被美国两家最大的地区性肾脏交易所使用。更重要的是,它在全国范围内运营着器官共享联合网络(UNOS),其中包括153个移植中心。这项工作揭示了易货交易中的无数公开问题,这笔赠款将通过开发计算技术、进行计算实验和研究成果来解决这些问题。这项拨款下的研究每年仅在美国就有可能拯救数百人的生命,而与已故捐赠者等待名单的整合有可能拯救数千人。这种方法还通过将患者从透析中转移到生产劳动大军中来显著提高生活质量。移植的社会益处也来自于比透析更便宜的移植;据独立估计,在美国,这一影响在五年内达到7.5亿美元。这个项目将集中于肾脏交换和其他易货市场的四个方面,如下:1.开发计算技术,为动态问题自动得出市场清算政策;2)开发计算技术,自动确定哪些边缘(可能的捐赠)测试兼容性和其他生存能力;3)开发市场设计和计算技术,用于整合已故捐赠者等待名单和肾脏交换;以及4)开发市场设计和计算技术,以推广患者可以有多个捐赠者,反之亦然。这里开发的技术也将适用于其他领域的其他易货交易所。
英文摘要
In the US alone, 35,000 patients with terminal kidney disease get added to the deceased-donor wait list each year, and 100,000 await for a kidney transplant - more than all other solid-organ transplants combined. That demand far exceeds the supply of deceased-donor kidneys. It is possible for a living person to donate a kidney, but it is unlikely that a given donor can donate to a given patient due to blood type and tissue type incompatibilities. This opens the door for kidney exchange where such willing donor-patient pairs "swap" donors. In modern kidney exchanges these "swaps" are conducted via cycles and altruist-donor-initiated chains. Prior work in developing the methods, algorithms, and software for kidney exchanges has already been used by two of the largest regional kidney exchanges in the US. More importantly, it runs the United Network for Organ Sharing (UNOS) nationwide kidney exchange, which includes 153 transplant centers. This work has uncovered a myriad of open problems in barter exchanges, which this grant will address by developing computational techniques, conducting computational experiments, and fielding the fruits of the research. The research under this grant has the potential to save hundreds of lives annually in the US alone, and the integration with the deceased-donor waiting list has the potential to save thousands. The approach also leads to dramatic improvements in the quality of life by moving patients off dialysis and back into the productive work force. Societal benefits come also from transplants being less expensive than dialysis; this effect has been independently estimated to be $750 million in the US over five years. This project will focus on four prongs for kidney exchanges and other barter markets, as follows: 1. developing computational techniques for automatically deriving market-clearing policies for dynamic problems; 2) developing computational techniques for automatically determining dynamically which edges (possible donations) to test for compatibility and other viability; 3) developing market designs and computational techniques for integrating the deceased-donor waiting list and kidney exchange; and 4) developing market designs and computational techniques for generalizations where a patient can have multiple donors and vice versa. The techniques developed here will apply to other barter exchanges in a broad range of other domains as well.
期刊论文(76)
专著(0)
科研奖励(0)
会议论文
Bayesian Multiagent Inverse Reinforcement Learning for Policy Recommendation
用于政策建议的贝叶斯多智能体逆强化学习
DOI: --
发表时间: 2021
期刊: AAAI Workshop on Reinforcement Learning in Games
影响因子: --
作者: [Martin, C., Sandholm, A.]
通讯作者: Sandholm, A.
DOI: --
发表时间: 2020
期刊: AAAI Workshop on Reinforcement Learning in Games
影响因子: --
作者: [Farina, G., Schmucker, R., Sandholm, T.]
通讯作者: Sandholm, T.
Combination treatment optimization using a pan-cancer pathway model
使用泛癌途径模型优化联合治疗
DOI: 10.1101/2020.07.05.184960
发表时间: 2020
期刊: not applicable - unpublished manuscript
影响因子: --
作者: [Schmucker, R., Farina, G., Fæder, J., Fröhlich, F., Saglam, A. S., Sandholm, T.]
通讯作者: Sandholm, T.
Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond
具有公共机会移动及其他情况的两人扩展形式博弈中最优相关均衡的多项式时间计算
DOI: --
发表时间: 2020
期刊: Conference on Neural Information Processing Systems
影响因子: --
作者: [Farina, G., Sandholm, T.]
通讯作者: Sandholm, T.
共 57 条
    RI: Medium: Techniques for Massive-Scale Strategic Reasoning: Imperfect-Information Subgame Solving and Offering Guarantees in Simulation-Based Games
    • 批准号:
      2312342
    • 项目类别:
      Standard Grant
    • 资助金额:
      $85.49万
    • 财政年份:
      2023
    • 负责人:
      Tuomas Sandholm
    • 依托单位:
    RI: Small: Computational Techniques for Large Multi-Step Incomplete-Information Games
    • 批准号:
      1617590
    • 项目类别:
      Standard Grant
    • 资助金额:
      $45.0万
    • 财政年份:
      2016
    • 负责人:
      Tuomas Sandholm
    • 依托单位:
    EAGER: Exploiting a myopic opponent in imperfect-information games: Toward medical applications
    • 批准号:
      1546752
    • 项目类别:
      Standard Grant
    • 资助金额:
      $10.0万
    • 财政年份:
      2015
    • 负责人:
      Tuomas Sandholm
    • 依托单位:
    RI: Small: Expressiveness and Automated Bundling in Mechanism Design: Principles and Computational Methodologies
    • 批准号:
      1320620
    • 项目类别:
      Standard Grant
    • 资助金额:
      $42.5万
    • 财政年份:
      2013
    • 负责人:
      Tuomas Sandholm
    • 依托单位:
    国内基金
    海外基金
    昼夜节律性small RNA在血斑形成时间推断中的法医学应用研究
    • 批准号:
    • 项目类别:
      省市级项目
    • 资助金额:
      --
    • 批准年份:
      2024
    • 负责人:
    • 依托单位:
    tRNA-derived small RNA上调YBX1/CCL5通路参与硼替佐米诱导慢性疼痛的机制研究
    • 批准号:
    • 项目类别:
      省市级项目
    • 资助金额:
      10.0万元
    • 批准年份:
      2022
    • 负责人:
      张祥忠
    • 依托单位:
    Small RNA调控I-F型CRISPR-Cas适应性免疫性的应答及分子机制
    Small RNAs调控解淀粉芽胞杆菌FZB42生防功能的机制研究
    • 批准号:
      31972324
    • 项目类别:
      面上项目
    • 资助金额:
      58.0万元
    • 批准年份:
      2019
    • 负责人:
      高学文
    • 依托单位: