Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time

10/03/2018

∙

by   Kanstantsin Pashkovich, et al.

∙

0

∙

share

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.