Yang Cai is an Associate Professor of Computer Science and Economics (secondary appointment) at Yale University. He is the Research Director for Computer Science at the Center for Algorithms, Data, & Market Design at Yale (CADMY) and a member of the Institute for Foundations of Data Science (FDS).

Interests
  • Theory of Computation
  • Economics & Computation
  • Optimization
  • Learning
Education
  • Ph.D. in Computer Science, 2013

    MIT

  • B.Sc. in Electrical Engineering and Computer Science, 2008

    Peking University

Recent Publications

(2024). The Power of Two-sided Recruitment in Two-sided Markets. Proceedings of the 56th Annual ACM SIGACT Symposium on Theory of Computing (STOC).

arxiv

(2024). Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games. Proceedings of the 27th International Conference on Artificial Intelligence and Statistics (AISTATS Oral).

arxiv

(2023). Simultaneous Auctions are Approximately Revenue-Optimal for Subadditive Bidders. Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS).

PDF arxiv

(2023). Doubly Optimal No-Regret Learning in Monotone Games. The 40th International Conference on Machine Learning (ICML).

PDF arxiv

(2023). Nearly Optimal Committee Selection For Bias Minimization. Proceedings of the 24th ACM Conference on Economics and Computation (EC).

PDF arxiv

Teaching

CPSC 366: Intensive Algorithms. Spring 2021, Spring 2020, Spring 2019

CPSC 455 / 555 ECON 425: Economics and Computation. Fall 2022, Fall 2020, Fall 2019

CPSC 612: Topics in Algorithmic Game Theory: Learning and Games. Spring 2023, Spring 2024.

Contact

  • yang.cai@yale.edu
  • Room 338, 17 Hillhouse Avenue, New Haven, CT 06511