Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time
arXiv:1810.02670
Abstract
We provide an algorithm for computing the nucleolus for an instance of a weighted voting game in pseudo-polynomial time. This resolves an open question posed by Elkind. et.al. 2007.