An optimal bound to access the core in TU-games.
Sylvain BéalEric RémilaPhilippe SolalPublished in: Games Econ. Behav. (2013)
Keyphrases
- coalition structure generation
- worst case
- coalitional games
- upper bound
- lower bound
- dynamic programming
- cooperative game
- computer games
- optimal design
- asymptotically optimal
- integer solution
- mind change
- action sets
- random access
- coalition formation
- game theory
- nash equilibria
- coalition structures
- optimal cost
- access control
- reinforcement learning
- website
- feature selection