AI Chat AI Image Generator AI Video Text to Speech

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

10/03/2018

∙

by Kanstantsin Pashkovich, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 03/08/2018

Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time

We provide an efficient algorithm for computing the nucleolus for an ins...

0 Jochen Koenemann, et al. ∙

research

∙ 01/27/2021

Pseudo Polynomial Size LP Formulation for Calculating the Least Core Value of Weighted Voting Games

In this paper, we propose a pseudo polynomial size LP formulation for fi...

0 Masato Tanaka, et al. ∙

research

∙ 01/06/2023

Measuring a Priori Voting Power – Taking Delegations Seriously

We introduce new power indices to measure the a priori voting power of v...

0 Rachael Colley, et al. ∙

research

∙ 08/28/2018

A Note on the Complexity of Manipulating Weighted Schulze Voting

We prove that the constructive weighted coalitional manipulation problem...

0 Julian Müller, et al. ∙

research

∙ 04/23/2012

Solving Weighted Voting Game Design Problems Optimally: Representations, Synthesis, and Enumeration

We study the inverse power index problem for weighted voting games: the ...

0 Bart de Keijzer, et al. ∙

research

∙ 11/09/2009

Manipulating Tournaments in Cup and Round Robin Competitions

In sports competitions, teams can manipulate the result by, for instance...

0 Tyrel Russell, et al. ∙

research

∙ 05/14/2020

A Weighted Mutual k-Nearest Neighbour for Classification Mining

kNN is a very effective Instance based learning method, and it is easy t...

0 Joydip Dhar, et al. ∙