A Social Choice Function Proposal to Aggregate Preferences in a Group Decision Making Process


Gurbuz T.

World Congress on Engineering and Computer Science, San-Francisco, Kostarika, 23 - 25 Ekim 2013, ss.1206-1210 identifier identifier

  • Basıldığı Şehir: San-Francisco
  • Basıldığı Ülke: Kostarika
  • Sayfa Sayıları: ss.1206-1210

Özet

In order to generate a single preference order for the society, a set of operations must be made on the preferences of the individuals forming that society. The aim of this paper is to propose a new Social Choice Function - SCF which will do this procedure. There are numerous functions that do this based on different intuitions or ideas. The function proposed in this paper has been developed with the intuitive approach that is based on the distances of the candidates to the ranks retrieved from the voters' ranking (as in the function of Cook & Seiford). The proposed function has a rather simple algorithm which, at each step, assigns a candidate to the closest possible rank while considering that distance has been covered for the next iteration. The function's process is designed in such way that the function will try to solve as much as possible the cases where there is indifference between candidates.