Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Thang, Nguyen Kim - Center for Algorithmic Game Theory, Department of Computer Science, Aarhus Universitet
Research Statement Nguyen Kim Thang
N P-hardness of pure Nash equilibrium in Scheduling and Connection Games
Non-clairvoyant Scheduling Games Christoph Durr
Pure Equilibria: Existence and Inefficiency & Online Auction
Online Scheduling of Bounded Length Jobs to Maximize Throughput
Nash equilibria in Voronoi games on graphs Christoph Durr
Nguyen Kim Thang Dept. of Computer Science
Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs
