Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
We introduce new online models for two important aspects of modern financial markets: Volume Weighted Average Price trading and limit order books. We provide an extensive study o...
Sham Kakade, Michael J. Kearns, Yishay Mansour, Lu...
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
Monte Lunacek, L. Darrell Whitley, James N. Knight
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...
Cesim Erten, Stephen G. Kobourov, Vu Le, Armand Na...