Selected work

Representative Papers

Position: Machine Learning for Heart Transplant Allocation Policy Optimization Should Account for Incentives

Feb 04, 2026

This study addresses the misaligned incentives among transplant centers, clinicians, and regulatory agencies—a critical yet overlooked factor that undermines the effectiveness of current heart allocation policies. For the first time, organ allocation is modeled as a multi-agent strategic process, and an incentive-aware allocation framework is proposed that integrates mechanism design with data-driven methodologies. By synthesizing insights from mechanism design, strategic classification, causal inference, and social choice theory, the work systematically quantifies the real-world adverse impacts of incentive misalignment in adult heart transplantation in the United States. The resulting framework offers a novel paradigm for designing allocation policies that are not only more equitable and efficient but also robust to strategic behavior, thereby advancing interdisciplinary innovation at the intersection of machine learning and social science.

1 citationsRead paper

Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation

Feb 04, 2026

This work addresses the lack of theoretical guarantees in online matching algorithms commonly used in critical applications such as organ allocation. We propose a coarse-grained dynamic matching approach based on clustering offline nodes into capacity-constrained groups, which substantially reduces problem complexity while preserving essential structural information. For the first time, we rigorously prove that this coarse-graining strategy incurs no significant performance loss and, in fact, achieves near-optimal theoretical guarantees—thereby providing a formal foundation for clustering-based practices in organ allocation. In simulations of heart transplant allocation, our method performs nearly as well as an omniscient benchmark and significantly outperforms conventional heuristic strategies.

1 citationsRead paper

Learning and Computation of $Phi$-Equilibria at the Frontier of Tractability

Feb 25, 2025

This paper studies $Phi$-equilibrium computation and low-$Phi$-regret online learning under a family $Phi$ of $k$-dimensional polynomial mappings, breaking the classical linear-bias restriction. We propose a nested algorithmic framework based on Ellipsoid-based Adversarial Hopes (EAH), integrating a convex-set oracle model with polynomial expectation fixed-point techniques to achieve efficient $Phi$-equilibrium approximation under polynomial-dimensional bias—first such result. Our contributions include: (i) an $varepsilon$-approximate $Phi$-equilibrium algorithm with time complexity $mathrm{poly}(n,d,k,log(1/varepsilon))$; (ii) an online learning algorithm achieving average $Phi$-regret $leq varepsilon$ within $mathrm{poly}(d,k)/varepsilon^2$ rounds; and (iii) matching upper and lower bounds establishing the first tight learnability characterization for $Phi$-equilibria under polynomial mappings.

1 citationsRead paper

Test-time Reinforcement Learning in Imperfect Information Games

Aug 31, 2026

研究使用策略梯度算法解决不完美信息博弈中测试时策略调整问题，通过隐式表示和正规化方法保证性能，实验证明该方法有效提升表现。

0 citationsRead paper

Watermarked Game Solving via Perturbed Regret Minimization

Aug 14, 2026

This study addresses the vulnerability of existing game agent watermarking schemes to incomplete information and misuse risks by proposing a novel embedding method based on perturbed regret minimization. For the first time, this approach integrates watermarking mechanisms directly into the learning process of incomplete-information games, enabling both embedding and detection through utility perturbation. The core contribution lies in guaranteeing bounded and negligible exploitability loss while maintaining high detection reliability. Notably, verification can be completed within hours at human play speed. This work effectively bridges the technical gap in copyright protection for agents operating under incomplete information, offering a robust solution that balances security with performance integrity in strategic learning environments.

0 citationsRead paper

Recent publications

Latest Papers

Test-time Reinforcement Learning in Imperfect Information Games

Aug 31, 2026

研究使用策略梯度算法解决不完美信息博弈中测试时策略调整问题，通过隐式表示和正规化方法保证性能，实验证明该方法有效提升表现。

0 citationsRead paper

Watermarked Game Solving via Perturbed Regret Minimization

Aug 14, 2026

This study addresses the vulnerability of existing game agent watermarking schemes to incomplete information and misuse risks by proposing a novel embedding method based on perturbed regret minimization. For the first time, this approach integrates watermarking mechanisms directly into the learning process of incomplete-information games, enabling both embedding and detection through utility perturbation. The core contribution lies in guaranteeing bounded and negligible exploitability loss while maintaining high detection reliability. Notably, verification can be completed within hours at human play speed. This work effectively bridges the technical gap in copyright protection for agents operating under incomplete information, offering a robust solution that balances security with performance integrity in strategic learning environments.

0 citationsRead paper

Distributed Constraint Optimization via Online Learning and Iterative Pricing with Application to Large-Scale Satellite Scheduling

Jul 28, 2026

This work addresses the challenge of globally solving distributed constraint optimization problems (DCOPs) in large-scale decentralized satellite scheduling under stringent communication constraints. To overcome this, the authors propose a novel framework that integrates online learning with problem decomposition. The approach decouples the DCOP into a high-level task assignment meta-problem and local scheduling subproblems, coordinated through a feedback-driven iterative pricing mechanism. By innovatively combining modern online learning algorithms with potential game modeling, the method efficiently converges to an equilibrium solution. Evaluated on realistic satellite scheduling scenarios, the proposed framework achieves over 99% satisfaction rate for observation requests, substantially outperforming existing baselines, which attain only 87%.

0 citationsRead paper

Aligning Data-Driven Predictors with Allocation: A Decision-Focused Approach to Survival Analysis

Jun 01, 2026

Although traditional survival prediction models achieve strong performance on metrics such as the concordance index (C-index), they often perform poorly—sometimes worse than random selection—in downstream decision-making tasks like organ allocation. This work proposes a decision-oriented approach to survival analysis by introducing normalized discounted cumulative gain (NDCG), a metric from information retrieval, directly aligning prediction objectives with allocation policies. We develop a ranking-based evaluation method tailored for right-censored data and construct a bootstrap-based NDCG optimization framework to fine-tune existing survival models. Evaluated on real-world U.S. heart transplant data, our method improves baseline NDCG by 50–100%, potentially saving tens of thousands of life-years annually while providing theoretical guarantees on allocation performance.

0 citationsRead paper

On the Complexity of Correlated Equilibria Beyond Normal-Form Games

May 17, 2026

This work resolves a long-standing open problem regarding the computational complexity of correlated equilibria in extensive-form games, congestion games, and general concave games. By reducing the computation of correlated equilibria in concave quadratic games to the problem of finding a fixed point of a contraction mapping (Contr-hard), it establishes, for the first time, the computational hardness of this task and proves an exponential lower bound on swap regret. To circumvent this barrier, the paper introduces a tractable relaxation—Φ-equilibria—and presents the first fully polynomial-time approximation scheme (FPTAS). Leveraging contraction mappings and online learning techniques under the Mahalanobis norm, the proposed algorithm achieves efficient computation in time polynomial in both the dimension $d$ and $\log(1/\varepsilon)$.

0 citationsRead paper