Statement of PurposeSepehr AssadiI am applying to the California Institute of Technology for admission to the PhD program in Computer Science. My main area of ​​interest is theoretical computer science, including approximation, random algorithms and algorithmic game theory. I plan to continue my research and further deepen my knowledge in these areas during my graduate studies. Being born into an academic family, my life is closely linked to the academic world. This training as well as the research experiences I acquired during my undergraduate studies motivate me to continue my studies with a doctorate in computer science and then take a position in academia. Right from my early days in high school, programming was a big hobby of mine. Additionally, I have always been fascinated by mathematics. These two interests motivated me to study computer engineering at Sharif University of Technology, the best technical institute in Iran. There, taking theoretical courses introduced me to theoretical computer science as the perfect blend of mathematics and computer science that I enjoy the most. Additionally, by taking additional courses in linear algebra and advanced topics in computability, complexity and logic theory1, I improved my knowledge in areas missing from my regular program. These activities strengthened my knowledge of theoretical computer science, and as a result, I received the gold medal in the 17th National Science Olympiad for University Students in Computer Engineering in Spring 2012, which is held annually among the best students of undergraduate. have been deeply involved in theoretical concepts, mainly through participation in related research groups. The first research group I participate in...... middle of article ......D student. I believe that the California Institute of Technology may be an ideal choice for me because of the close parallels between my interests and those of several faculty members. In particular, I found the work done by Professor Katrina Ligett on algorithmic game theory to be a great fit for my interests. To be precise, his work on network design in the article On the Price of Stability for Undirected Network Design is a type of work that I know and appreciate the most3. Professor Adam Wierman's work on algorithmic game theory is also very interesting to me. Thank you very much for your attention. : On the convergence towards Nash equilibria of regret minimization algorithms in routing games and games with approximation algorithms2