معرفی
Prof. Niv Buchbinder is a faculty member in the Department of Statistics and Operations Research at the School of Mathematical Sciences, Tel Aviv University. His research centers on algorithmic solutions for combinatorial optimization in offline and online contexts, with significant contributions to primal-dual methodologies and algorithmic game theory.
His academic background includes a Ph.D. in Computer Science from the Technion (2008) under Prof. Seffi Naor and an M.Sc. in Computer Science from the Technion (2003) under Prof. Erez Petrank. Key research areas encompass Combinatorial Optimization, Online Algorithms, Algorithmic Game Theory, Primal-Dual Methods, and Submodular Optimization, focusing on competitive analysis for problems like set cover, ad-auctions, and caching.
Recent publications (2012-2015) reveal a concentrated effort in submodular optimization and online decision-making, with applications in advertising, resource allocation, and machine learning. These works consistently employ primal-dual frameworks to achieve strong competitive ratios in adversarial settings.
Scientific recognition includes:
- Best Paper Award at ESA 2007 for “Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue”
- Best Paper Award at FOCS 2011 for “A Polylogarithmic Competitive Algorithm for the k-Server Problem”
No information is available regarding student advising or research grants. Similarly, details about laboratory facilities, research teams, or future projects are not provided in the source materials.
