### Professor Ilan Adler

Department of Industrial Engineering and Operations Research

University of California at Berkeley

Random Knockout Tournaments, * Operations Research, * Volume 65(6), Pages: 1589-1596, (2017)

Production Lot Sizing with Immediately Observable Random Production Rate , with D. Bu and P. Kaminsky, *optimization-online, DB 2017/12/6392, *(2017)

Strategic Choices in the Secretary Problem, with N. and N. Truong, (2016)

Incentive Compatible Mechanisms in the Secretary Problem, with N. and N. Truong, (2016)

Some LCPs solvable in strongly polynomial time with Lemke algorithm,
with R. W. Cottle, and J.S.Pang,
* Mathematical Programming, *
Ser A, Volume 160(1), Pages :477-493, (2016)

On Simplex Pivoting Rules
and Complexity Theory,
with C. H. Papadimitriou and A.Rubinstein,
* Lecture Notes in Computer Science, Proceedings of the 17th International Conference on
Integer Programming and Combinatorial Optimization (IPCO),
*
Volume 8494, Pages: 13-24, (2014)

A direct reduction of PPAD Lemke-verified Linear Complementarity Problems to Bimatrix Games , with S. Verma, *arXiv:1302.0067, *(2013)

The equivalence of linear programs and zero-sum games, * International Journal of Game Theory, * Volume 42, Pages: 165-177,
(2013)

Direct Reduction of PPAD Linear Complementarity Problems to Bimatrix Games (Extended abstract), with S. Verma, (2012)

Score Probabilities for Serve and Rally Competitions,
with S. M. Ross,
* Math Scientist, *
Volume 37, Pages: 47-54,
(2012)

Benchmark Problems
for Totally Unimodular Set System Auction,
with D. S. Hochbaum,
* arXiv:1102.3499, *
(2011)

The Linear Complementarity Problem, Lemke Algorithm, Perturbation, and the Complexity Class PPAD,
with S. Verma,
* Optimization online, *
(2011)

New characterizations of row sufficient matrices,
with R. W. Cottle, and S. Verma,
* Linear Algebra and its Applications, * Volume 430, Issues 11-12, Pages: 2950-2960, (2009)

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)

Fundamental Transformations of Sudoku Grids,
with A. Adler,
* Mathematical Spectrum, *
Volume 41, No 1, Pages: 1-7, (2008)

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), **INFORMS 2010 Best Paper in Energy**

A further step in decision support models for energy markets (editorial),
with A. Ramos,* European Journal of Operational Research, *
Volume 181, Issues 3, Pages: 1243-1244, (2007)

Two-settlement electricity markets with price caps and Cournot generation firms,
with S. S. Oren, and J. Yao,
* European Journal of Operational Research, *
Volume 181, Issues 3, Pages: 1279-1296, (2007)

Sufficient Matrices Belong to L,
with R. W. Cottle, and S. Verma,
* Mathematical Programming, *
Ser A, Volume 106, Pages :391-401, (2006)

Cournot Equilibria in Two-Settlement Electricity Markets with System Contingencies
with S. S. Oren, and J. Yao,
* International Journal of Critical Infrastructures, *
Volume 3, No 1-2, Pages: 142-160, (2006)

"Cournot Equilibrium in Price-Capped Two-Settlement Electricity Markets,
with S. S. Oren, B. Willems, and J. Yao, * Proceeding of the 38th Hawaii International Conference on Systems Sciences HICSS38, *
Pages: 1-10, (2005)

A probabilistic model for the survivability of cells,
with H-S Ahn , R. M. Karp, and S. M. Ross,
* J. Appl. Probab., *
Volume 42, No. 4, Pages: 919-931, (2005)

"Computing Two Settlement Cournot Equilibria in Electricity Markets,
with S. S. Oren, and J. Yao,
* Proceeding of the 37th Hawaii International Conference on Systems Sciences HICSS37, *
Pages: 1-9, (2004)

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)

The Coupon-Collector Problem Revisited,
with S. S. Oren, and S. M. Ross,
* Journal of Applied Probability, *
Volume 40, Pages: 513-518, (2003)

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)

Conditions for Arbitrage in Investment Selections, with S. M. Ross, * Journal of Bond Trading & Management, * Volume 1, No 1, Pages: 20-26, (2002)

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)

The Coupon Subset Collection Problem,
with S. M. Ross,
* Journal of Applied Probability, *
Volume 38, Pages: 737-746, (2001)

A probabilistic Approach to Identifying Positive Value Cash Flows,
with S. M. Ross,
* Math. Scientist, *
Volume 26, Pages: 103-107, (2001)

A New Parameterization Algorithm for the Linear Complementarity Problem,
with P. A. Beling, and S. Verma,
* Nonconvex Optimizationand its Applications, *
Volume 42, Pages: 545-560, (2000)

Distribution of the Time of the First k-Record,
with S. M. Ross,
* Probability in the Engineering and Information Sciences, *
Volume 11, Pages: 273-278, (1997)

Arbitrage and growth rate for riskless investments in a stationary economy,
with D. Gale,
* Mathematical Finance, *
Volume 1, No 1, Pages: 73-81, (1997)

Primal-dual Interior Point Algorithms for Convex Quadratically Constrained and Semidefinite Optimization Problems,
with F. Alizadeh,
* Rutcor Research Report, *
RRR 46-95, Pages: 1-22, (1995)

Certain Connections between Convex Quadratic Optimization
by Artificial Analogue Neural Networks and Traditional Methods
of Mathematical Programming,
with S. Verma,
(1995)

Polynomial Algorithms for Linear Programming over
the Algebraic Numbers,
with P. A. Beling,
* Algorithmica, *
Volume 12, Pages: 436-457, (1994)

Monge and feasibility sequences in
general flow problems,
with A. J. Hoffman, and R. Shamir,
* Discrete Applied Mathematics, *
Volume 44, Pages: 21-38, (1993)

A randomized scheme for speeding up
algorithms for linear and convex
programming problems with high
constraints-to-variables ratio,
with R. Shamir,
* Mathematical Programming, *
Volume 61, Pages: 39-52, (1993)

Greedily solvable transportation networks and edge-guided vertex elimination
(Abstract),
with R. Shamir,
* Network Optimization Problems: Algorithms, Applications and Complexity (eds Du D.-Z., Pardalos P. M.), *,
Pages: 1-22, (1993)

A Geometric View of Parametric Linear Programming,
with R. D. C. Monteiro,
* Algorithmica, *
Volume 8, Pages: 161-176, (1992)

Polynomial algorithms for LP over a subring of the algebraic integers with applications to
LP with circulant matrices,
with P. A. Beling,
* Mathematical Programming, *
Volume 57, Pages: 121-143, (1992)

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)

A Strongly Polynomial Algorithm for a Special Class of Linear Programming,
with S. Cosares,
* Operations Research, *
Volume 32, No 6, Pages: 955-960, (1991)

Limiting behavior of the affine scaling continuous trajectories for linear
programming problems,
with R. D. C. Monteiro,
* Mathematical Programming, *
Volume 50, Pages: 29-51, (1991)

Polynomial algorithms for LP over a subring of the algebraic integers with applications to
LP with circulant matrices,
with P. A. Beling,
* 32nd Annual Symposium of Foundations of Computer Science (FOCS), *
Pages: 480-487, (1991)

A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and its Power series Extension,
with R. D. C. Monteiro and M. G. C. Resende,
* Mathematics of Operations Research, *
Volume 15, No 2, Pages: 191-214, (1990)

Advantageous properties of dual transhipment polyhedra,
with S. Cosares,
* SIAM Journal of Discrete Mathematics, * Volume 3, No 2, Pages: 157-167, (1990)

An Extention of Karmarkar type algorithm to a class of convex seperable programming
problems with global linear rate of convergence, with R. D. C. Monteiro,
* Mathematics of Operations Research, *
Volume 15, No 1-3, Pages: 408-422, (1990)

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)

An implementation of Karmarkar's algorithm for linear programming,
with N. Karmarkar, M. G. C. Resende, and G. Veiga,
* Mathematical Programming, *
Volume 44, No 1-3, Pages: 297-335, (1989)

Data Structures and Programming Techniques for the Implementation of Karmarkar's algorithm, with N. Karmarkar, M. G. C. Resende, and G. Veiga, * ORSA Journal of Computingl, * Volume 1, No 2, Pages: 84-106, (1989)

A Simplex Variant Solving an m x d Linear Program in
O(min(m2, d2)) Expected Number of Pivot Steps,
with R. M. Karp, and R. Shamir,
* Journal of Complexity, *
Volume 3, Pages: 372-387, (1987)

A Family of Simplex Variants Solving an m x d Linear Program in Expected Number of Pivot Steps
Depending on d Only,
with R. M. Karp, and R. Shamir,
* Mathematics of Operations Research, *
Volume 11, No 4, Pages: 570-590, (1986)

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: 471-495, (1985)

New results on the average
behvior of Simplex algorithms,
with N.Megiddo, and M. L. Todd,
* Bulletin of the American Mathematical Society, *
Volume 11, No 2, Pages: 378-382, (1984)

A Simplex Algorithm Whose Average Number of Steps
Is Bounded between Two Quadratic Function
of the Smaller Dimension,
with N.Megiddo,
* The 16th ACM Symposium on Theory of Computing (STOC), *
Pages: 312-323, (1984)

The Expected Number of Pivots Needed to Solve Parametric Linear Programs and the Efficiency of the Self-Dual Simplex Method,
(1983)

Random Linear Programs (Abstract),
with S. E. D. Berenguer,
* UC Berkeley OR Center, Pages: 1-33,
* ORC 81-4, (1981)

Capturing and Clustering Judges' Policies,
with D. Kafry,
* Organizational Behavior and Human Performance, *
Volume 25, Pages: 384-394, (1980)

Appliacation of the Kachian-Shor
algorithm to a class of linear complementarity problems,
with R. P. Mclean and J. S. Provan,
* Cowles Foundation Discussion paper, Yale University, *
No 549, Pages: 1-12, (1980)

The max-flowproblem with parametric capacities,
with J. Somers,
* Discrete Applied Mathematics, *
Volume 1, Pages: 287-300, (1979)

Postoptimality Analysis Methodology for freeway on-ramp control , with M. Eldor, ,
* Transportation Research Record, *
Issue 644, Pages: 51-53, (1977)

Long Monotone Paths in Abstract Polytopes,
with R. Saigal, * Mathematics of Operations Research* *, * Volume 1, No 1, Pages: 89-95, (1976)

Eligible Cuts in Simple Polytopes (Abstract),
with A. Ulkucu,
* UC Berkeley OR Center, *
ORC 75-10, Pages: 1-18, (1975)

On the Solutions of the Positive Semi-Definite Complementarity Problem (Abstract),
with D. Gale,
* UC Berkeley OR Center, *
ORC 75-12, Pages: 1-16, (1975)

Longitudinal Budget Planning Models (Abstract),
with R. Levin, and R. M. Oliver,
* UC Berkeley OR Center, *
ORC 74-24, Pages: 1-26, (1975)

Rational Approach to Dirty Politics (Abstract),
* UC Berkeley OR Center, *
ORC 74-28, Pages: 1-19, (1974)

Lower Bounds for Maximum diameters of polytopes ,
* Mathematical Programming Studies* *, * Volume 1, Pages: 11-19, (1974)

Maximum Diameter of Abstract Polytopes ,
with G. B. Dantzig, * Mathematical Programming Studies* *, * Volume 1, Pages: 20-40, (1974)

Existence of A-Avoiding Paths in Abstract
Polytopes ,
with G. B. Dantzig and K. Murty, * Mathematical Programming Studies*,
Volume 1, Pages: 41-42, (1974)

On the number of iterations in Dantzig-Wolfe decomposition ,
with A. Ulkucu, * Decomposition of Large Scale Problems
(ed. D. M. Himmelblau), * Pages:181-187, (1973)

Maximum Diameter of Abstract Polytopes ,
with G. B. Dantzig, * IDA Economic Papers, * Pages: 1-30, (1972)

Graphs and Dual Graphs of Abstract Polytopes , * Stanford OR Technical
Report*, UC Berkeley OR Center,
ORC 71-26,, Pages: 1-22, (1971)

The Euler Characteristic of Abstract Polytopes
(Abstract) , * Stanford OR Technical
Report*, 71-11, Pages: 1-22, (1971)

On Bounds for Complementarity Trees in a Graph (Abstract)* Stanford OR Technical Report, *
No. 69-13, Pages: 1-13, (1969)

Social Optimization Versus Self-Optimization in Waiting Lines* Stanford Technical Report: Department of OR and Department of Statistics, *
No. 69-126, Pages: 1-30, (1969)