Collaborative Research: The Optimal Timing of Kidney Exchanges: A Markov Game Approach

合作研究：肾脏交换的最佳时机：马尔可夫博弈方法

• 批准号: 1069100
• 负责人: M. Utku Unver
• 金额: $ 9.1万
• 依托单位: Boston College
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2011
• 资助国家: 美国
• 起止时间: 2011-05-01 至 2014-04-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1069100&HistoricalAwards=false
• 关键词: Collaborative; Research; Optimal; Timing; Kidney

The objective of this collaborative research project is to provide much more accurate valuations of potential paired kidney exchanges (PKEs). Given an arbitrary-sized PKE, consider the question of when (in terms of patient health) an exchange should occur. An exchange is only possible if every patient in the exchange desires it. This problem is naturally formulated as an infinite-horizon stochastic game. Analyzing this stochastic game reveals several unique features (e.g. the exchange probabilities completely characterize the equilibria, and one can restrict attention to equilibria in which only one patient randomizes). One can then demonstrate a one-to-one correspondence between the equilibria of this game and the feasible points of a certain mixed-integer program. Extensions include iterative approaches to this game, as well as modeling extensions, such as cadaveric kidney arrivals and altruistic donors. This goal will be accomplished in three ways: 1) By comparing quality-adjusted life expectancies, it will value exchanges where the patients and donors are well matched more than others; 2) It will consider dynamic patient health; and 3) It allows patients to determine when the transplantations should occur.Given the severe shortage of kidneys and the potential of paired kidney exchanges, this research can lead to much better matching between patients and donors. Medical researchers, graduate students and undergraduate students will benefit from this research as it blends important aspects of operations research, medicine, and economics.

这项合作研究项目的目的是提供更准确的潜在配对肾脏交换（PKE）的估值。 给定一个任意大小的PKE，考虑何时（就患者健康而言）应该进行交换的问题。 交换只有在每个病人都愿意的情况下才是可能的，这个问题很自然地被表述为一个无限时域随机博弈。 分析这个随机博弈揭示了几个独特的特征（例如，交换概率完全表征了均衡，并且可以将注意力限制在只有一个患者随机化的均衡上）。然后可以证明这个博弈的均衡和某个混合整数规划的可行点之间的一一对应。扩展包括这个游戏的迭代方法，以及建模扩展，例如尸体肾脏到达和利他主义捐赠者。 这一目标将通过三种方式实现：1）通过比较质量调整的预期寿命，它将重视患者和捐赠者匹配良好的交换; 2）它将考虑动态患者健康; 3）它允许患者决定何时进行移植。鉴于肾脏严重短缺和配对肾脏交换的可能性，这项研究可以使病人和捐赠者之间更好地匹配。 医学研究人员，研究生和本科生将受益于这项研究，因为它融合了运筹学，医学和经济学的重要方面。