Estimating the efficiency of voting in big size committees

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11230%2F11%3A10100635" target="_blank" >RIV/00216208:11230/11:10100635 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Estimating the efficiency of voting in big size committees

Popis výsledku v původním jazyce

In a simple voting committee with a finite number of members, in which each member has a voting weight, the voting rule is defined by the quota (a minimal number of voting weights is required to approve a proposal), and the efficiency of voting in the committee is defined as the ratio of the number of winning coalitions (subsets of the set of members with total voting weights no less than the quota) to the number of all possible coalitions. A straightforward way of calculating the efficiency is based onthe full enumeration of all coalitions and testing whether or not they are winning. The enumeration of all coalitions is NP-complete problem (the time required to find the solution grows exponentially with the size of the committee) and is unusable forbig size committees. In this paper we are developing three algorithms (two exact and one heuristic) to compute the efficiency for committees with high number of voters within a reasonable timeframe.

Název v anglickém jazyce

Estimating the efficiency of voting in big size committees

Popis výsledku anglicky

In a simple voting committee with a finite number of members, in which each member has a voting weight, the voting rule is defined by the quota (a minimal number of voting weights is required to approve a proposal), and the efficiency of voting in the committee is defined as the ratio of the number of winning coalitions (subsets of the set of members with total voting weights no less than the quota) to the number of all possible coalitions. A straightforward way of calculating the efficiency is based onthe full enumeration of all coalitions and testing whether or not they are winning. The enumeration of all coalitions is NP-complete problem (the time required to find the solution grows exponentially with the size of the committee) and is unusable forbig size committees. In this paper we are developing three algorithms (two exact and one heuristic) to compute the efficiency for committees with high number of voters within a reasonable timeframe.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

AH - Ekonomie

OECD FORD obor

—

Projekt

<a href="/cs/project/GA402%2F09%2F1066" target="_blank" >GA402/09/1066: Politická ekonomie volebního chování, teorie racionálního voliče a modely strategického hlasování</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Acta Universitatis Carolinae. Oeconomica, Czech Economic Review

ISSN

1802-4696

e-ISSN

—

Svazek periodika

5

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

19

Strana od-do

172-190

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—