Siddharth Prasad
Email: sprasad2 (at) cs (dot) cmu (dot) edu |

I am a first year PhD student in the Computer Science Department at Carnegie Mellon University advised by Nina Balcan and Tuomas Sandholm. I am interested in the interaction between learning theory, algorithms, and mechanism design. Previously, I got a B.S. in Math and Computer Science from Caltech.

- Efficient Algorithms for Learning
Revenue-Maximizing Two-Part Tariffs
(with Nina Balcan and
Tuomas Sandholm).

29th International Joint Conference on Artificial Intelligence (IJCAI 2020). -
Incentive Compatible Active Learning
(with Federico Echenique).
[arXiv]
[slides]
[video]

11th Innovations in Theoretical Computer Science Conference (ITCS 2020). -
Learning Time Dependent Choice
(with Zachary Chase).
[arXiv]
[slides]

10th Innovations in Theoretical Computer Science Conference (ITCS 2019).

- Notes on mechanism design.
- Notes on effective descriptive set theory.
- Walks on Primes in Imaginary Quadratic Fields

- CS 151: Complexity Theory (Spring 2019).
- CS/SS/Ec 149: Algorithmic Economics (Winter 2019).
- CS 38: Introduction to Algorithms (Spring 2017).
- CS 21: Decidability and Tractability (Winter 2017).
- Ma 0: Transition to Mathematical Proofs (Summer 2017, Summer 2018).