Login / Signup
On the quality and complexity of pareto equilibria in the job scheduling game.
Leah Epstein
Elena Kleiman
Published in:
AAMAS (2011)
Keyphrases
</>
job scheduling
game theoretic
game theory
nash equilibrium
nash equilibria
worst case
games with incomplete information
decision problems
pure strategy
computational complexity
resource allocation
extensive form games
database
genetic algorithm
objective function
repeated games