 | 2009 |
|---|
| 8 |       | Kevin Leyton-Brown,
Eugene Nudelman,
Yoav Shoham:
Empirical hardness models: Methodology and a case study on combinatorial auctions.
J. ACM 56(4): (2009) |
| 2005 |
|---|
| 7 |  | Samuel Ieong,
Robert McGrew,
Eugene Nudelman,
Yoav Shoham,
Qixiang Sun:
Fast and Compact: A Simple Class of Congestion Games.
AAAI 2005: 489-494 |
| 2004 |
|---|
| 6 | | Ryan Porter,
Eugene Nudelman,
Yoav Shoham:
Simple Search Methods for Finding a Nash Equilibrium.
AAAI 2004: 664-669 |
| 5 | | Eugene Nudelman,
Jennifer Wortman,
Yoav Shoham,
Kevin Leyton-Brown:
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms.
AAMAS 2004: 880-887 |
| 4 | | Eugene Nudelman,
Kevin Leyton-Brown,
Holger H. Hoos,
Alex Devkar,
Yoav Shoham:
Understanding Random SAT: Beyond the Clauses-to-Variables Ratio.
CP 2004: 438-452 |
| 2003 |
|---|
| 3 | | Kevin Leyton-Brown,
Eugene Nudelman,
Galen Andrew,
Jim McFadden,
Yoav Shoham:
Boosting as a Metaphor for Algorithm Design.
CP 2003: 899-903 |
| 2 | | Kevin Leyton-Brown,
Eugene Nudelman,
Galen Andrew,
Jim McFadden,
Yoav Shoham:
A Portfolio Approach to Algorithm Selection.
IJCAI 2003: 1542-1542 |
| 2002 |
|---|
| 1 | | Kevin Leyton-Brown,
Eugene Nudelman,
Yoav Shoham:
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions.
CP 2002: 556-572 |
