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

TL;DR

This paper presents a pseudo-polynomial time algorithm for computing the nucleolus in weighted voting games, addressing an open problem in cooperative game theory.

Contribution

It introduces a novel algorithm that efficiently computes the nucleolus for weighted voting games, solving a long-standing open question.

Findings

Algorithm operates in pseudo-polynomial time

Resolves the open problem posed by Elkind et al. 2007

Advances computational methods in cooperative game theory

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.