Ilan Adler

46 papers A* 3B 1Journal 38Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
A generalization of von Neumann's reduction from the assignment problem to zero-sum games.
Games Econ. Behav.
Ilan Adler, Martin Bullinger, Vijay V. Vazirani
2025 J jnl
Improved bounds on the probability of a union and on the number of events that occur.
Oper. Res. Lett.
Ilan Adler, Richard M. Karp, Sheldon M. Ross
2024 J jnl
A Generalization of von Neumann's Reduction from the Assignment Problem to Zero-Sum Games.
CoRR
Ilan Adler, Martin Bullinger, Vijay V. Vazirani
2021 J jnl
Diameters of Cocircuit Graphs of Oriented Matroids: An Update.
Electron. J. Comb.
Ilan Adler, Jesús A. De Loera, Steven Klee, Zhenyang Zhang
2020 — conf
New Proximal Newton-Type Methods for Convex Optimization.
CDC
Ilan Adler, Zhiyue Tom Hu, Tianyi Lin
2017 J jnl
Random Knockout Tournaments.
Oper. Res.
Ilan Adler, Yang Cao, Richard M. Karp, Erol A. Peköz, Sheldon M. Ross
2016 J jnl
Some LCPs solvable in strongly polynomial time with Lemke's algorithm.
Math. Program.
Ilan Adler, Richard W. Cottle, Jong-Shi Pang
2014 B conf
On Simplex Pivoting Rules and Complexity Theory.
IPCO
Ilan Adler, Christos H. Papadimitriou, Aviad Rubinstein
2014 J jnl
On Simplex Pivoting Rules and Complexity Theory.
CoRR
Ilan Adler, Christos H. Papadimitriou, Aviad Rubinstein
2013 J jnl
A direct reduction of PPAD Lemke-verified linear complementarity problems to bimatrix games
CoRR
Ilan Adler, Sushil Verma
2013 J jnl
The equivalence of linear programs and zero-sum games.
Int. J. Game Theory
Ilan Adler
2011 J jnl
Benchmark Problems for Totally Unimodular Set System Auction
CoRR
Ilan Adler, Dorit S. Hochbaum
2009 — conf
A Note on Strictly Competitive Games.
WINE
Ilan Adler, Constantinos Daskalakis, Christos H. Papadimitriou
2009 J jnl
The Berkeley Memorial.
Games Econ. Behav.
Alan Weinstein, Harold Kuhn, Leo A. Goodman, Dan McFadden, Joel Sobel, Ilan Adler, Jacob Feldman, Ahmet Alkan, Katharine Gale, Elizabeth Dunning, Samara Watkiss, Roger Gilbert, Jonathan Birt, Graham Ingham, Sandra M. Gilbert
2008 J jnl
Modeling and Computing Two-Settlement Oligopolistic Equilibrium in a Congested Electricity Network.
Oper. Res.
Jian Yao, Ilan Adler, Shmuel S. Oren
2007 J jnl
A further step in decision support models for energy markets.
Eur. J. Oper. Res.
Andrés Ramos, Ilan Adler
2007 J jnl
Cournot equilibria in two-settlement electricity markets with system contingencies.
Int. J. Crit. Infrastructures
Jian Yao, Shmuel S. Oren, Ilan Adler
2007 J jnl
Two-settlement electricity markets with price caps and Cournot generation firms.
Eur. J. Oper. Res.
Jian Yao, Shmuel S. Oren, Ilan Adler
2006 J jnl
Sufficient matrices belong to L.
Math. Program.
Ilan Adler, Richard W. Cottle, Sushil Verma
2005 — conf
Cournot Equilibrium in Price-Capped Two-Settlement Electricity Markets.
HICSS
Jian Yao, Bert Willems, Shmuel S. Oren, Ilan Adler
2004 — conf
Computing Cournot Equilibria in Two Settlement Electricity Markets with Transmission Constraints.
HICSS
Jian Yao, Shmuel S. Oren, Ilan Adler
2003 J jnl
Coalescing times for IID random variables with applications to population biology.
Random Struct. Algorithms
Ilan Adler, Hyun-Soo Ahn, Richard M. Karp, Sheldon M. Ross
2002 J jnl
Baseball, Optimization, and the World Wide Web.
Interfaces
Ilan Adler, Alan L. Erera, Dorit S. Hochbaum, Eli V. Olinick
2001 J jnl
On the maximum number of Hamiltonian paths in tournaments.
Random Struct. Algorithms
Ilan Adler, Noga Alon, Sheldon M. Ross
1994 J jnl
Polynomial Algorithms for Linear Programming over the Algebraic Numbers.
Algorithmica
Ilan Adler, Peter A. Beling
1993 J jnl
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio.
Math. Program.
Ilan Adler, Ron Shamir
1993 J jnl
Monge and Feasibility Sequences in General Flow Problems.
Discret. Appl. Math.
Ilan Adler, Alan J. Hoffman, Ron Shamir
1992 J jnl
A Geometric View of Parametric Linear Programming.
Algorithmica
Ilan Adler, Renato D. C. Monteiro
1992 A* conf
Polynomial Algorithms for Linear Programming over the Algebraic Numbers
STOC
Ilan Adler, Peter A. Beling
1992 J jnl
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices.
Math. Program.
Ilan Adler, Peter A. Beling
1991 J jnl
A Strongly Polynomial Algorithm for a Special Class of Linear Programs.
Oper. Res.
Ilan Adler, Steven Cosares
1991 J jnl
Limiting behavior of the affine scaling continuous trajectories for linear programming problems.
Math. Program.
Ilan Adler, Renato D. C. Monteiro
1991 A* conf
Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices
FOCS
Ilan Adler, Peter A. Beling
1990 J jnl
A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension.
Math. Oper. Res.
Renato D. C. Monteiro, Ilan Adler, Mauricio G. C. Resende
1990 J jnl
Advantageous Properties of Dual Transhipment Polyhedra.
SIAM J. Discret. Math.
Ilan Adler, Steven Cosares
1990 J jnl
An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence.
Math. Oper. Res.
Renato D. C. Monteiro, Ilan Adler
1989 J jnl
An implementation of Karmarkar's algorithm for linear programming.
Math. Program.
Ilan Adler, Mauricio G. C. Resende, Geraldo Veiga, Narendra Karmarkar
1989 J jnl
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm.
INFORMS J. Comput.
Ilan Adler, Narendra Karmarkar, Mauricio G. C. Resende, Geraldo Veiga
1989 J jnl
Interior path following primal-dual algorithms. part I: Linear programming.
Math. Program.
Renato D. C. Monteiro, Ilan Adler
1989 J jnl
Interior path following primal-dual algorithms. part II: Convex quadratic programming.
Math. Program.
Renato D. C. Monteiro, Ilan Adler
1987 J jnl
A simplex variant solving an
J. Complex.
Ilan Adler, Richard M. Karp, Ron Shamir
1986 J jnl
A Family of Simplex Variants Solving an
Math. Oper. Res.
Ilan Adler, Richard M. Karp, Ron Shamir
1985 J jnl
A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension
J. ACM
Ilan Adler, Nimrod Megiddo
1984 A* conf
A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension
STOC
Ilan Adler, Nimrod Megiddo
1979 J jnl
The max-flow problem with parametric capacities.
Discret. Appl. Math.
Janet Somers, Ilan Adler
1976 J jnl
Long Monotone Paths in Abstract Polytopes.
Math. Oper. Res.
Ilan Adler, Romesh Saigal