On penalty-based aggregation functions and consensus
Beliakov, Gleb, Calvo, Tomasa and James, Simon 2011, On penalty-based aggregation functions and consensus, in Consensual processes, Springer-Verlag, Berlin, Germany, pp.23-40.
Attached Files
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name
Description
MIMEType
Size
Downloads
Title
On penalty-based aggregation functions and consensus
The problem of aggregating individual preferences in order to arrive at a group consensus arises naturally in elections where a candidate must be chosen that best represents the individuals’ differing opinions. Other contexts include the judging of sporting competitions and the fusion of sensor readings. In these applications it makes sense that the aggregated result should be as close as possible to the individual inputs, giving rise to the need for methods that minimize this difference. Penalty-based aggregation functions are precisely those functions that aim to accomplish this, drawing upon various notions of “difference” in varying situations.
ISBN
9783642205323 9783642205330 3642205321
ISSN
1434-9922
Language
eng
Field of Research
080108 Neural, Evolutionary and Fuzzy Computation
Socio Economic Objective
970108 Expanding Knowledge in the Information and Computing Sciences