Anthony Kim
I am an Assistant Professor of Decision Sciences in the SKK Graduate School of Business at Sungkyunkwan University. My primary research interests are in revenue management and sequential decision making. Previously, I was an applied scientist at Amazon in the Sponsored Products Allocation, Pricing, and Marketplace Controls team. I was a postdoctoral research scholar in the Decision, Risk, and Operations Division of Columbia Business School. I finished my PhD in Computer Science at Stanford University under the supervision of Prof. Amin Saberi in the Management Science and Engineering Department.
Links to: CV, Google scholar page
Email: aekim [at] skku (dot) edu
Office: International Hall 90408
Education
- Ph.D., Computer Science, Stanford University, 2018.
- M.Eng., Electrical Engineering and Computer Science, MIT, 2010.
- B.S., Electrical Engineering and Computer Science, MIT, 2009.
- B.S., Mathematics, MIT, 2009.
Honors and Awards
- Research Paper Honorable Mention in the 27th Web Conference, 2018.
- NSF Graduate Research Fellowship, 2012 - 2015.
- Eta Kappa Nu National Honor Society for EECS
Professional Activities
- Program Committee member for International Symposium on Algorithmic Game Theory, 2025 - 2026.
- Program Committee member or reviewer for ACM Web Conference, 2020 - 2025.
- Program Committee member for ACM Conference on Economics and Computation, 2024.
- Reviewer for Management Science, Manufacturing and Service Operations Management, Operations Research.
Journal Publications
- On the Futility of Dynamics in Robust Mechanism Design (with a technical report).
S. Balseiro, A. Kim, and D. Russo
- Operations Research, Volume 69, Issue 6, 2021.
- Deals or No Deals: Contract Design for Online Advertising.
A. Kim, V. Mirrokni, and H. Nazerzadeh
- Operations Research, Volume 69, Issue 5, 2021.
- Preliminary version by my co-authors appeared in the 26th International World Wide Web Conference (WWW), 2017.
- Budget-Management Strategies in Repeated Auctions.
S. Balseiro, A. Kim, M. Mahdian, and V. Mirrokni
- Operations Research, Volume 69, Issue 3, 2021.
- Extended abstract "Budget-Constrained Incentive Compatibility for Stationary Mechanisms" appeared in the 21st ACM Conference on Economics and Computation (EC), 2020.
- Preliminary version (for different parts than the EC version above) appeared in the 26th International World Wide Web Conference (WWW), 2017.
- Welfare Maximization with Production Costs: A Primal Dual Approach.
Z. Huang and A. Kim
- Games and Economic Behavior (GEB), Volume 118, November 2019. (Special Section on STOC/FOCS/SODA 2014-15)
- Preliminary version appeared in the 26th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015.
- Near-Optimal No-Regret Algorithms for Zero-Sum Games.
C. Daskalakis, A. Deckelbaum, and A. Kim
- Games and Economic Behavior (GEB), Volume 92, July 2015. (Special Issue: Algorithmic Game Theory -- STOC/FOCS/SODA 2011)
- Preliminary version appeared in the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011.
Conference Publications (not mentioned above)
- Minimizing Latency in Online Ride and Delivery Services.
A. Das, S. Gollapudi, A. Kim, D. Panigrahi, and C. Swamy
- In the 27th Web Conference (formerly, World Wide Web Conference), 2018. (Research Paper Honorable Mention)
- Online Energy Storage Management: an Algorithmic Approach.
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.
A. Kim
- In the 23rd European Symposium on Algorithms (ESA), 2015.
- The Shapley Value in Knapsack Budgeted Games.
S. Bhagat, A. Kim, S. Muthukrishnan, and U. Weinsberg
- In the 10th Conference on Web and Internet Economics (WINE), 2014.
- 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.
- 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.
Theses