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

01/27/2021
by   Masato Tanaka, et al.
0

In this paper, we propose a pseudo polynomial size LP formulation for finding a payoff vector in the least core of a weighted voting game. Both the number of variables and number of constraints in our formulation are bounded by (Wn) where W is the total sum of (integer) voting weights and n is the number of players. When we employ our formulation, a commercial LP solver calculates a payoff vector in the least core of practical weighted voting games in a few seconds. We also extend our approach to vector weighted voting games.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro