A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure.
René van den BrinkIlya KatsevGerard van der LaanPublished in: Int. J. Game Theory (2011)
Keyphrases
- computational complexity
- cost function
- learning algorithm
- graph structure
- detection algorithm
- optimization algorithm
- dynamic programming
- particle swarm optimization
- tree structure
- optimal solution
- worst case
- search space
- special case
- probabilistic model
- strongly polynomial
- preprocessing
- multi class classification
- approximation ratio
- computational cost
- matching algorithm
- np hard
- similarity measure
- clustering algorithm