Total tightness implies Nash-solvability for three-person game forms.
Endre BorosOndrej CepekVladimir GurvichPublished in: Discret. Math. (2012)
Keyphrases
- nash equilibrium
- game theory
- nash equilibria
- cooperative game
- game theoretic
- computer games
- evolutionary game
- stochastic games
- video games
- incomplete information
- equilibrium strategies
- pareto optimal
- game based learning
- role playing
- solution concepts
- resource allocation
- educational games
- game play
- game playing
- data sets
- genetic algorithm
- human computation
- person re identification
- repeated games
- multi agent
- imperfect information
- lower bound
- human beings
- worst case