Bounds for the diameter of the weight polytope

08/08/2018
by   Sascha Kurz, et al.
0

A weighted game or a threshold function in general admits different weighted representations even if the sum of non-negative weights is fixed to one. Here we study bounds for the diameter of the corresponding weight polytope. It turns out that the diameter can be upper bounded in terms of the maximum weight and the quota or threshold. We apply those results to approximation results between power distributions, given by power indices, and weights.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2019

Cops and Robbers on graphs of bounded diameter

The game of Cops and Robbers is a well known game played on graphs. In t...
research
06/30/2021

Bounds on the Diameter of Graph Associahedra

Graph associahedra are generalized permutohedra arising as special cases...
research
05/28/2020

Optimal Anticodes, Diameter Perfect Codes, Chains and Weights

Let P be a poset on [n] = {1,2,...,n}, F^n_q be the linear space of n-tu...
research
02/01/2018

Approximating power by weights

Determining the power distribution of the members of a shareholder meeti...
research
11/17/2017

Graph Clustering using Effective Resistance

#1#1 We design a polynomial time algorithm that for any weighted undire...
research
08/16/2020

Diameter Polytopes of Feasible Binary Programs

Feasible binary programs often have multiple optimal solutions, which is...
research
01/17/2018

The Complexity of Subdivision for Diameter-Distance Tests

We present a general framework for analyzing the complexity of subdivisi...

Please sign up or login with your details

Forgot password? Click here to reset