Nguyễn Kim Thắng

Computer Science, Ecole Polytechnique.
My CV and Research Statement.
Cell phone: 0033 6 28 79 46 11.
Email: thang at lix.polytechnique.fr

Research interests: Algorithmic Game Theory, Design and Analysis of Algorithms (especially, Approximation and Online Algorithms).

Publications:

• Christoph Dürr, Nguyễn Kim Thắng, Łukasz Jeż, Online Scheduling of Bounded Length Jobs to Maximize Throughput, WAOA '09.
• Christoph Dürr, Nguyễn Kim Thắng, Non-clairvoyant Scheduling Games, SAGT '09.
• Nguyễn Kim Thắng, NP-hardness of pure Nash equilibrium in Scheduling and Connection Games, SOFSEM '09.
• Christoph Dürr, Nguyễn Kim Thắng, Nash Equilibria on Voronoi Games on Graphs, ESA '07.

Thesis: Pure Equilibria: Existence and Inefficiency & Online Auction, Ecole Polytechnique '09 (talk)

Selected Talks

• Scheduling Games in the Dark, Aarhus 09
• Algorithmic Game Theory, LIAFA 09 (program)
• NP-hardness of pure Nash equilibrium in Scheduling and Connection Games, SOFSEM'09 (and my poster)
• Nash Equilibria on Voronoi Games on Graphs, ESA'07

Notes:

• Nguyễn Kim Thắng, On the existence of equilibria in Weighted Facility Location Games.
• Nguyễn Kim Thắng, Faithful Nash equilibrium.

Teaching: (at University of Paris-Sud, Orsay)

• Fall '08: Algorithms and Complexity (Course for 3rd-year students).
• Fall '08: Algorithms on Graphs (Master course).
• Past teaching: Networks and Internet, Compilation, Architecture of Computer, Programming in C.

Personal: I play soccer, swim and go out with friends in my spare time. My personal information (friends only)