Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

A universal voting system based on the Potential Method (CROSBI ID 234717)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Čaklović, Lavoslav ; Kurdija, Adrian Satja A universal voting system based on the Potential Method // European journal of operational research, 259 (2017), 2; 677-688. doi: 10.1016/j.ejor.2016.10.032

Podaci o odgovornosti

Čaklović, Lavoslav ; Kurdija, Adrian Satja

engleski

A universal voting system based on the Potential Method

Pairwise comparison of various objects (alternatives) is common in many procedures related to decision making. Potential Method (PM) uses a (weighted) preference graph as the basic structure generated by such comparisons to obtain a value function (potential) on the set of alternatives. The potential is calculated as a solution of a system of equations involving the Laplacian matrix of the preference graph. In multiple-criteria decision analysis or group decision making, each criterion or decision maker is represented by its preference graph. A multigraph obtained by joining these graphs aggregates the individual preferences and generates the group potential. Moreover, the influence (weight) of each criterion or decision maker on the group potential may be adjusted. In this article the aggregation of preference graphs is applied to voting systems. Many different forms of voting ballots can generate preference graphs, which gives us a universal (ballot-independent) voting system. As an illustration of the PM in the voting context we have chosen the Eurovision Song Contest and the analysis of the cookie-type ballots where the voters allocate a certain number of points (cookies) to the candidates.

Decision analysis ; Preference graph ; Voting ; Group decision ; Potential Method

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

259 (2)

2017.

677-688

objavljeno

0377-2217

1872-6860

10.1016/j.ejor.2016.10.032

Povezanost rada

Matematika

Poveznice
Indeksiranost