Avrim Blum's research projects

• A new theoretical approach to analyzing clustering
• A new theoretical approach to learning with similarity functions
• Other topics in Computational Learning theory including:
  • semi-supervised learning
  • online learning
  • models of learning
• Algorithmic Game Theory and Mechanism Design
  • Relations between learning/dynamics and equilibria.
  • Auctions and pricing problems.
  • More algorithmic notions of price of anarchy.
• Approximation algorithms for TSP-related problems.
  • TSP with Deadlines, Orienteering, Discounted-TSP, and the k-MST problem.
• Other approximation algorithms.
• Online algorithms (routing, admission control, scheduling, online auctions).

For the most up-to-date information, see my publications page.

For reasonably up-to-date information see:

• a web page for my 2001-2004 NSF progress reports, and
• some of my survey talks.