Eugene Nudelman

According to our database1, Eugene Nudelman authored at least 8 papers between 2002 and 2009.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
Empirical hardness models: Methodology and a case study on combinatorial auctions.
J. ACM, 2009

2008
Simple search methods for finding a Nash equilibrium.
Games Econ. Behav., 2008

2005
Fast and Compact: A Simple Class of Congestion Games.
Proceedings of the Proceedings, 2005

2004
Understanding Random SAT: Beyond the Clauses-to-Variables Ratio.
Proceedings of the Principles and Practice of Constraint Programming, 2004

Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

2003
A Portfolio Approach to Algorithm Selection.
Proceedings of the IJCAI-03, 2003

Boosting as a Metaphor for Algorithm Design.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions.
Proceedings of the Principles and Practice of Constraint Programming, 2002


  Loading...