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

Kim Thang Nguyen (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-540-95891-8_38

access: closed

type: Conference or Workshop Paper

metadata version: 2022-03-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sofsem/Thang09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sofsem/Thang09
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.