Banzhaf Power in Hierarchical Games
For my thesis in applied math & computer science, I introduced an algorithm to calculate the Banzhaf Power Index in a hierarchical voting game with a runtime of O(NS 2S), where N is the number of players in the game and S is the branching factor in the game tree, an exponential improvement over the standard naive algorithm, which has runtime O(N2 2N). I then applied the algorithm to 2 examples: French Senate elections and the importance of words in determining positive or negative sentiment in language.
This work was published as part of AAMAS (International Conference on Autonomous Agents and Multiagent Systems) 2024.