An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure.
René van den BrinkIlya KatsevGerard van der LaanPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- tree structure
- experimental evaluation
- np hard
- learning algorithm
- cost function
- dynamic programming
- detection algorithm
- computational cost
- k means
- computational complexity
- high accuracy
- graph structure
- preprocessing
- search algorithm
- positive and negative
- matching algorithm
- monte carlo
- optimization algorithm
- objective function
- clustering method
- recognition algorithm
- probabilistic model
- conflict free
- weighted majority
- expectation maximization
- simulated annealing
- worst case
- significant improvement
- search space
- optimal solution
- reinforcement learning