Ilan Adler

Ilan Adler is a Chancellor's professor in the department of Operations Research and Industrial Engineering at the University of California in Berkeley, which he joined in 1970, and served as a chair in 2003 (acting) and 2005-2008. Professor Adler holds a B.A in Economics and Statistics from the Hebrew University in Israel (1966), a M.Sc. in Operations Research from the Technion in Israel (1967), and a Ph.D. in Operations Research from Stanford (1970). Professor Adler is an affiliated Professor (2016-2020) in Tsinghua University, and a faculty member in the Tsinghua-Berkeley-Shenzhen-Institute (TBSI).

• • Mathematical Programming 
  • Computational Game Theory
  • Applied Probability

   

• The Expected Number of Pivots Needed to Solve Parametric Linear Programs and the Efficiency of the Self-Dual Simplex Method, (1983)
• A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension, with N.Megiddo, Journal of the Association for Computing Macinery, Volume 32, No 4, Pages: 871-895, (1985)
• Interior path following primal-dual algorithms. part I: Linear programming, with R. D. C. Monteiro, Mathematical Programming, Volume 44, No 1-3, Pages: 27-41, (1989)
• Interior path following primal-dual algorithms. part II: Convex quadratic programming, with R. D. C. Monteiro, Mathematical Programming, Volume 44, No 1-3, Pages: 43-66, (1989)
• Polynomial Algorithms for Linear Programming over the Algebraic Numbers, with P. A. Beling, The 24th ACM Symposium on Theory of Computing (STOC), Pages: 483-494, (1992) [Full version in Algorithmica, Volume 12, Pages: 436-457, (1994)]
• A Geometric View of Parametric Linear Programming, with R. D. C. Monteiro, Algorithmica, Volume 8, Pages: 161-176, (1992)
• Arbitrage and growth rate for riskless investments in a stationary economy, with D. Gale, Mathematical Finance, Volume 1, No 1, Pages: 73-81, (1997)
• On the Maximum Number of Hamiltonian Paths in Tournaments, with N. Alon and S. M. Ross, Random Structures and Algorithms, Volume 18, Issue 3, Pages: 291-296, (2001)
• Baseball, Optimization, and the World Wide Web, with A.L. Erera , D.S. Hochbaum , and E. V. Olinick, Interfaces, Volume 32, No 2, Pages: 12-22, (2002)
• Coalescing Times for IID Random Variables with Applications to Population Biology, with H-S Ahn , R. M. Karp, and S. M. Ross, Random tructures and Algorithms, Volume 23, Issue 2, Pages: 155-166, (2003)
• Modeling and Computing two-settlement Oligopolistic Equilibrium in a Congested Electricity Network, with S. S. Oren, and J. Yao, Operations Research, Volume 56, No 1, Pages: 34-47, (2008)
• Fundamental Transformations of Sudoku Grids, with A. Adler, Mathematical Spectrum, Volume 41, No 1, Pages: 1-7, (2008)
• A Note on Strictly Competitive Games, with C. Daskalakis, and C. H. Papadimitriou, INTERNET AND NETWORK ECONOMICS Lecture Notes in Computer Science, Volume 5929, Pages: 471-474, (2009) 
• The equivalence of linear programs and zero-sum games, International Journal of Game Theory, Volume 42, Pages: 165-177, (2013)
• A direct reduction of PPAD Lemke-verified Linear Complementarity Problems to Bimatrix Games, with S. Verma, arXiv:1302.0067, (2013)
• Random Knockout Tournaments, with Y. Cao, R. Karp, E. Peköz, and S. Ross. To appear, Operations Research (2017)