2000 character limit reached
Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time
Published 3 Oct 2018 in cs.GT and math.OC | (1810.02670v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.