Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Efficient algorithm for designing weighted voting games

Tools
- Tools
+ Tools

Aziz, H., Paterson, Michael S. and Leech, Dennis (2007) Efficient algorithm for designing weighted voting games. University of Warwick. Department of Computer Science. (Department of Computer Science Research Report).

[img]
Preview
PDF
WRAP_Paterson_cs-rr-434.pdf - Published Version - Requires a PDF viewer.

Download (429Kb) | Preview

Request Changes to record.

Abstract

Weighted voting games are mathematical models, used to analyse situations where voters with variable voting weight vote in favour of or against a decision. They have been applied in various political and economic organizations. Similar combinatorial models are also encountered in neuro-science and distributed systems. The calculation of voting powers of players in a weighted voting game has been extensively researched in the last few years. However, the inverse problem of designing a weighted voting game with a desirable distribution of power has received less attention. We present an elegant algorithm which uses generating functions and interpolation to compute an integer weight vector for target Banzhaf power indices. This algorithm has better performance than any other known to us. It can also be used to design egalitarian two-tier weighted voting games and the representative weighted voting game for a multiple weighted voting game.

Item Type: Report
Subjects: H Social Sciences > HB Economic Theory
H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
J Political Science > JF Political institutions (General)
Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH): Generating functions, Decision making -- Mathematical models, Voting -- Mathematical models, Game theory
Series Name: Department of Computer Science Research Report
Publisher: University of Warwick. Department of Computer Science
Official Date: 20 May 2007
Dates:
DateEvent
20 May 2007UNSPECIFIED
Date of first compliant deposit: 28 July 2016
Number: Number 434
Number of Pages: 22
DOI: CS-RR-434
Institution: University of Warwick
Theses Department: Department of Computer Science
Status: Not Peer Reviewed
Publication Status: Published
Access rights to Published version: Open Access
Related URLs:
  • Organisation
  • Related item in WRAP

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us