E. Nudelman

Understanding Random SAT: Beyond the Clauses-to-Variables Ratio

Yoav Shoham, Kevin Leyton-Brown, Holger H. Hoos, 2004, CP.

Empirical approach to the complexity of hard problems

Y. Shoham, E. Nudelman, Eugene Nudelman, 2005 .

A portfolio approach to algorithm select

Yoav Shoham, Kevin Leyton-Brown, Eugene Nudelman, 2003, IJCAI 2003.

Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms

Yoav Shoham, Kevin Leyton-Brown, Jennifer Wortman Vaughan, 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

Empirical hardness models: Methodology and a case study on combinatorial auctions

Yoav Shoham, Kevin Leyton-Brown, Eugene Nudelman, 2009, JACM.

Simple search methods for finding a Nash equilibrium

Yoav Shoham, Ryan Porter, Eugene Nudelman, 2004, Games Econ. Behav..

Boosting as a Metaphor for Algorithm Design

Yoav Shoham, Kevin Leyton-Brown, Eugene Nudelman, 2003, CP.

Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions

Yoav Shoham, Kevin Leyton-Brown, Eugene Nudelman, 2002, CP.

Fast and Compact: A Simple Class of Congestion Games

Yoav Shoham, Samuel Ieong, Qixiang Sun, 2005, AAAI.