Optimal auction design is a fundamental problem in algorithmic game theo...
For any ε>0, we give a simple, deterministic
(6+ε)-approximation algorit...
A set function can be extended to the unit cube in various ways; the
cor...
Whereas interior point methods provide polynomial-time linear programmin...
We study the circuit diameter of polyhedra, introduced by Borgwardt, Fin...
We study properties and applications of various circuit imbalance measur...
We characterize a rich class of valuated matroids, called R-minor valuat...
We study the equilibrium computation problem in the Fisher market model ...
We consider the problem of approximating maximum Nash social welfare (NS...
In breakthrough work, Tardos (Oper. Res. '86) gave a proximity based
fra...
We present an O(nm) algorithm for all-pairs shortest paths computations ...
We present a strongly polynomial label-correcting algorithm for solving ...
Following the breakthrough work of Tardos in the bit-complexity model,
V...
We present a strongly polynomial algorithm for computing an equilibrium ...