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, Haris, Paterson, Michael S. and Leech, Dennis (2007) Efficient algorithm for designing weighted voting games. In: 11th IEEE International Multitopic Conference, Lahore, Pakistan, 28-30 Dec 2007. Published in: IEEE International Multitopic Conference, 2007. INMIC 2007. pp. 211-216. ISBN 9781424415526. doi:10.1109/INMIC.2007.4557718

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Official URL: http://dx.doi.org/10.1109/INMIC.2007.4557718

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 neuroscience, threshold logic, reliability theory 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 a representative weighted voting game for a multiple weighted voting game.

Item Type: Conference Item (Paper)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Journal or Publication Title: IEEE International Multitopic Conference, 2007. INMIC 2007.
Publisher: IEEE
ISBN: 9781424415526
Official Date: 2007
Dates:
DateEvent
2007Published
Number of Pages: 6
Page Range: pp. 211-216
DOI: 10.1109/INMIC.2007.4557718
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Conference Paper Type: Paper
Title of Event: 11th IEEE International Multitopic Conference
Type of Event: Conference
Location of Event: Lahore, Pakistan
Date(s) of Event: 28-30 Dec 2007

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

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