Posts

Showing posts from February 14, 2010

Congratulations to Kurt Mehlhorn

Congratulations to Kurt Mehlhorn for getting the EATCS lifetime achievment award for his role in development of algorithmics. Melhorn who has been based at MPI is also well known for the LEDA software. Other winners of the EATCS award include Les Valiant, Mike Paterson, Robin Milner and Richard Karp.

Algorithmic questions related to Nash equlibria

Marios Mavronicolas discusses algorithmic questions related to Nash equlibria in the complexity column of the recent BEATCS. The main theme is outlining a general NP-hardness reduction from SAT to various algorithmic questions related Nash equlibria. The original reduction is due to Conitzer and Sandholm.

3rd International Symposium on Algorithmic Game Theory

The website for the 3rd International Symposium on Algorithmic Game Theory is now up . The venue is Athens and the dates are 18-20 September 2010.