7 citations · 10 across the 8 of their papers we have counts for
8 papers
Improved Bounds on the Probability of a Union and on the Number of Events that Occur
Ilan Adler, Richard M. Karp, Sheldon M. Ross
Let be events in a sample space. Given the probability of the intersection of each collection of up to of these events, what can we say about the prob…
A Generalization of von Neumann's Reduction from the Assignment Problem to Zero-Sum Games
Ilan Adler, Martin Bullinger, Vijay V. Vazirani
The equivalence between von Neumann's Minimax Theorem for zero-sum games and the LP Duality Theorem connects cornerstone problems of the two fields of game theory and optimization,…
New Proximal Newton-Type Methods for Convex Optimization
Ilan Adler, Zhiyue Tom Hu, Tianyi Lin
In this paper, we propose new proximal Newton-type methods for convex optimization problems in composite form. The applications include model predictive control (MPC) and embedded…
Diameters of Cocircuit Graphs of Oriented Matroids: An Update
Ilan Adler, Jesús A. De Loera, Steven Klee +1
Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear pr…
Random Knockout Tournaments
Ilan Adler, Yang Cao, Richard Karp +2
We consider a random knockout tournament among players , in which each match involves two players. The match format is specified by the number of matches played in ea…
On Simplex Pivoting Rules and Complexity Theory
Ilan Adler, Christos Papadimitriou, Aviad Rubinstein
We show that there are simplex pivoting rules for which it is PSPACE-complete to tell if a particular basis will appear on the algorithm's path. Such rules cannot be the basis of a…
A direct reduction of PPAD Lemke-verified linear complementarity problems to bimatrix games
Ilan Adler, Sushil Verma
The linear complementarity problem, LCP(q,M), is defined as follows. For given M,q find z such that q+Mz>=0, z>=0, z(q + M z)=0,or certify that there is no such z. It is well known…
Benchmark Problems for Totally Unimodular Set System Auction
Ilan Adler, Dorit S. Hochbaum
We consider a generalization of the -flow set system auction where the set to be procured by a customer corresponds to a feasible solution to a linear programming problem where…