Statement of PurposeSepehr AssadiI am applying to the California Institute of Technology for admission to the computer science doctoral program. My main area of ​​interest is theoretical computer science, including approximation and randomized algorithms and algorithmic game theory. I plan to continue my research and further deepen my knowledge in these areas throughout my undergraduate career. Being born into an academic family has intertwined my life with academia. This background, along with the research experiences gathered during my undergraduate studies, motivates me to continue my studies through a PhD in computer science and subsequently pursue a position in academia. Since my early days of high school, programming has been a great hobby for me. Furthermore, I have always been fascinated by mathematics. These two interests motivated me to study Computer Engineering at Sharif University of Technology, Iran's premier technical institute. There, studying theoretical courses introduced me to theoretical computer science as the perfect combination of mathematics and computer science that I like the most. Furthermore, by taking extra courses in Linear Algebra and Advanced Topics in Computability Theory, Complexity and Logic1 I improved my knowledge in areas absent from my regular curriculum. These activities strengthened my knowledge in theoretical computer science, and as a result, I was awarded the Gold Medal at the 17th National Scientific Olympiad for Computer Engineering University Students in Spring 2012, which is held annually among the best university students in the rankings. have been deeply involved in theoretical concepts, mainly by attending related research groups. The first research group I participate in......middle of paper......D student. I believe the California Institute of Technology may be an ideal choice for me due to the close parallels between my interests and those of several faculty members. In particular, I found that the work done by Prof. Katrina Ligett on algorithmic game theory corresponds perfectly to my interests. To be specific, his work on network design in the paper On the Price of Stability for Undirected Network Design is a type of work I know and like best3. Prof. Adam Wierman's works on Algorithmic Game Theory are also very interesting to me. Thank you very much for your attention.2 Algorithmic Game Theory by Nisan, Roughgarden, Tardos, V. Vazirani3 Also, I can refer to his articles: Routing Without Regret : On the convergence towards Nash equilibria of regret minimization algorithms in games routing and running games with approximation algorithms2