Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions. - Kevin Leyton-Brown; Eugene Nudelman; Yoav Shoham (CP, 2002)

Boosting as a Metaphor for Algorithm Design. - Kevin Leyton-Brown; Eugene Nudelman; Galen Andrew; Jim McFadden; Yoav Shoham (CP, 2003)

A Portfolio Approach to Algorithm Selection. - Kevin Leyton-Brown; Eugene Nudelman; Galen Andrew; Jim McFadden; Yoav Shoham (IJCAI, 2003)

Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms. - Eugene Nudelman; Jennifer Wortman; Yoav Shoham; Kevin Leyton-Brown (AAMAS, 2004)

Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. - Eugene Nudelman; Kevin Leyton-Brown; Holger H. Hoos; Alex Devkar; Yoav Shoham (CP, 2004)

Fast and Compact: A Simple Class of Congestion Games. - Samuel Ieong; Robert McGrew 001; Eugene Nudelman; Yoav Shoham; Qixiang Sun (AAAI, 2005)

Empirical approach to the complexity of hard problems. - Eugene Nudelman (2006)

Simple search methods for finding a Nash equilibrium. - Ryan Porter; Eugene Nudelman; Yoav Shoham (Games Econ. Behav., 2008)

Empirical hardness models: Methodology and a case study on combinatorial auctions. - Kevin Leyton-Brown; Eugene Nudelman; Yoav Shoham (J. ACM, 2009)