Ofir Geri


I am a second-year Ph.D. student in the Computer Science Department at Stanford University. I am fortunate to be advised by Moses Charikar. Prior to that, I earned an M.Sc. degree in Computer Science from Tel-Aviv University, where I was advised by Michal Feldman.

My research interests are in algorithms and theoretical computer science, particularly approximation algorithms, online algorithms, and algorithmic game theory.

You may contact me by e-mail:


Do Capacity Constraints Constrain Coalitions?
Michal Feldman and Ofir Geri
ACM Transactions on Economics and Computation (TEAC), 2016
A preliminary version appeared in the Proceedings of the 29th AAAI Conference on Artificial Intelligence, 2015
[ TEAC paper | AAAI paper | arXiv ]

Working Papers

Min-cost Bipartite Matching with Delays
Itai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul Makhijani, Yuyi Wang, and Roger Wattenhofer


Computeron was a voluntary student project dedicated to fixing old computers and donating them to charity. Presentations from a tutorial I have taught as part of this project are available here (Hebrew only).