-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games.

Kim Thang Nguyen

Browse the full SOFSEM paper archive.