"On the quality and complexity of pareto equilibria in the job scheduling game."

Leah Epstein, Elena Kleiman (2011)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2011-11-18

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/atal/EpsteinK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/atal/EpsteinK11
Leah Epstein, Elena Kleiman:
On the quality and complexity of pareto equilibria in the job scheduling game. AAMAS 2011: 525-532

a service of

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.