1 citations · 2 across the 5 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
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.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…