Vidya Muthukumar
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Aaron Sidfordonce
- Yujia Jinonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| The Complexity of Infinite-Horizon General-Sum Stochastic Games | ITCS 2023 | 2023-01-10 |
Shows that finding an approximate Nash for infinite-horizon general-sum stochastic games is PPAD-complete both for simultaneous and for turn-based models under… | ||
| The Complexity of Infinite-Horizon General-Sum Stochastic Games: Turn-Based and Simultaneous Play | Multi-Agent Reinforcement Learning and Bandit Learning | 2022-04-29 |
Shows non‑stationary Nash equilibria computable poly(S,A) and stationary Nash equilibria computable poly(A), but proves computing an approximate stationary NE… | ||
| nothing matches | ||