- We present two approaches to compute banzhaf indexes for tree based algorithms, the first one relies on brute-force, as for the second on eit relies on the tree structure to facilitate the computations and improve its complexity.
- For further details, you can check the report we wrote explaining the two approaches.
forked from abdessalam-eddib/computing_banzhaf
-
Notifications
You must be signed in to change notification settings - Fork 0
License
AI-vidence/computing_banzhaf
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Languages
- Python 100.0%