3 papers
cs.GT2026
Beyond the PPAD hardness of Auto-bidding Auctions
Li Chen, Jamie Morgenstern, Yuanyuan Yang
Computing certain autobidding equilibria is PPAD complete in the worst case. Yet such instances rarely arise in practice, where advertisers running simple, decentralized learning s…
cs.LG2025
T-TAMER: Provably Taming Trade-offs in ML Serving
Yuanyuan Yang, Ruimin Zhang, Jamie Morgenstern +1
As machine learning models continue to grow in size and complexity, efficient serving faces increasingly broad trade-offs spanning accuracy, latency, resource usage, and other obje…
cs.GT2025
Markovian Pandora's box
Yuanyuan Yang, Ruimin Zhang, Jamie Morgenstern +1
In this paper, we study the Markovian Pandora's Box Problem, where decisions are governed by both order constraints and Markovianly correlated rewards, structured within a shared d…