I am a PhD student in the Computer Science Department at Stanford University studying theoretical computer science. My advisor is Prof. Amin Saberi in the Management Science and Engineering Department.
Previously, I have worked as a software developer at Oracle Corporation and as an intern at Quora, Technicolor Research Labs and Google (twice). For further details, please see my CV below.
Please find my CV HERE.
Email: tonyekim [at] stanford (dot) edu
Office: Gates 466
- Ph.D. Candidate, Computer Science, Stanford University, 2012 - Present.
- M.Eng., Electrical Engineering and Computer Science, MIT, 2010.
- B.S., Electrical Engineering and Computer Science, MIT, 2009.
- B.S., Mathematics, MIT, 2009.
- Minimizing Latency in Online Ride and Delivery Services.
A. Das, S. Gollapudi, A. Kim, D. Panigrahi, and C. Swamy
Accepted to the 27th Web Conference (formerly, World Wide Web Conference), 2018.
- Budget Management Strategies in Repeated Auctions.
S. Balseiro, A. Kim, M. Mahdian, and V. Mirrokni
In the 26th International World Wide Web Conference (WWW), 2017.
- Online Energy Storage Management: an Algorithmic Approach. [slides]
A. Kim, V. Liaghat, J. Qin, and A. Saberi
In the 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2016.
- Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems. [slides]
In the 23rd European Symposium on Algorithms (ESA), 2015.
- Welfare Maximization with Production Costs: A Primal Dual Approach. [slides]
Z. Huang and A. Kim
In the 26th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015.
- Invited to and to appear in Games and Economic Behavior (Special Issue for STOC/FOCS/SODA 2014-15).
- The Shapley Value in Knapsack Budgeted Games. [slides]
S. Bhagat, A. Kim, S. Muthukrishnan, and U. Weinsberg
In the 10th Conference on Web and Internet Economics (WINE), 2014.
- An earlier version appeared in the Fifth International Workshop on Computational Social Choice (COMSOC), 2014.
- Computing Bounds on Network Capacity Regions as a Polytope Reconstruction Problem.
A. Kim and M. Médard
In the IEEE International Symposium on Information Theory (ISIT), 2011.
- Near-Optimal No-Regret Algorithms for Zero-Sum Games.
C. Daskalakis, A. Deckelbaum, and A. Kim
In the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011.
- Invited to and to appear in Games and Economic Behavior (Special Issue for STOC/FOCS/SODA 2011).
- Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids.
A. Kim and M. Médard
Invited paper in the 6th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2010.
- On Network Coding Capacity - Matroidal Networks and Network Capacity Regions. (Errata)
Master's thesis, 2010.
- TA for CS261 Optimization and Algorithmic Paradigms by Prof. Moses Charikar, Winter 2017-18.
- Head TA for CS224W Analysis of Networks by Prof. Jure Leskovec, Fall 2017-18.
- TA for CS234 Reinforcement Learning by Prof. Emma Brunskill, Spring 2016-17.
- TA for CS246 Mining Massive Data Sets by Prof. Jeff Ullman, Winter 2016-17.
- TA for CS161 Design and Analysis of Algorithms by Prof. Moses Charikar, Fall 2016-17.
- TA for CS161 Design and Analysis of Algorithms by Prof. Virginia Williams, Spring 2015-16.
- Head TA for CS161 Design and Analysis of Algorithms by Prof. Leonidas Guibas, Winter 2015-16.
- TA for CS367 Algebraic Graph Algorithms by Prof. Virginia Williams, Fall 2015-16.