Eugene Nudelman

According to our database, Eugene Nudelman authored at least 9 papers between 2002 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2009

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

Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham

J. ACM, 2009

2008

Simple search methods for finding a Nash equilibrium.

Ryan Porter, Eugene Nudelman, Yoav Shoham

Games Econ. Behav., 2008

2006

Empirical approach to the complexity of hard problems.

Eugene Nudelman

PhD thesis, 2006

2005

Fast and Compact: A Simple Class of Congestion Games.

Samuel Ieong, Robert McGrew, Eugene Nudelman, Yoav Shoham, Qixiang Sun

Proceedings of the Proceedings, 2005

2004

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

Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoos, Alex Devkar, Yoav Shoham

Proceedings of the Principles and Practice of Constraint Programming, 2004

Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms.

Eugene Nudelman, Jennifer Wortman, Yoav Shoham, Kevin Leyton-Brown

Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

2003

A Portfolio Approach to Algorithm Selection.

Kevin Leyton-Brown, Eugene Nudelman, Galen Andrew, Jim McFadden, Yoav Shoham

Proceedings of the IJCAI-03, 2003

Boosting as a Metaphor for Algorithm Design.

Kevin Leyton-Brown, Eugene Nudelman, Galen Andrew, Jim McFadden, Yoav Shoham

Proceedings of the Principles and Practice of Constraint Programming, 2003

2002

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

Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham

Proceedings of the Principles and Practice of Constraint Programming, 2002