2000 character limit reached
Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time (1810.02670v1)
Published 3 Oct 2018 in cs.GT and math.OC
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.