default search action
"-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games."
Kim Thang Nguyen (2009)
- Kim Thang Nguyen:
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games. SOFSEM 2009: 413-424
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.