Ofir Geri

Photo

I am a 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:

Publications

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
The 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2017
[ APPROX ]

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 | AAAI | arXiv ]

Working Papers

On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings
Moses Charikar, Ofir Geri, and William Kuszmaul

Other

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).