The Computational Complexity of Finding a Mixed Berge Equilibrium for a k-Person Noncooperative Game in Normal Form.
Ahmad NahhasHerbert W. CorleyPublished in: IGTR (2018)
Keyphrases
- normal form
- nash equilibrium
- computational complexity
- game theory
- game theoretic
- nash equilibria
- pure strategy
- nested relations
- functional dependencies
- database design
- relational databases
- equilibrium strategies
- relational algebra
- information content
- variational inequalities
- special case
- worst case
- data dependencies
- games with incomplete information
- mixed strategy
- prime implicates
- repeated games
- np complete
- relational database theory
- object oriented
- databases
- database