On the bounds of weak manipulability of majoritarian aggregation procedures | Zendy

Fuad Aleskerov | Zendy; Daniel Karabekyan | Zendy; Alexander Ivanov | Zendy; Vyacheslav Yakuba | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the bounds of weak manipulability of majoritarian aggregation procedures

Author(s) -

Fuad Aleskerov,

Daniel Karabekyan,

Alexander Ivanov,

Vyacheslav Yakuba

Publication year - 2019

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2019.12.064

Subject(s) - computer science , relation (database) , degree (music) , upper and lower bounds , mathematical optimization , mathematical economics , mathematics , data mining , mathematical analysis , physics , acoustics

A model of upper and lower bounds of weak manipulability of 13 known aggregation procedures, based on majority relation, is proposed. The modified Nitzan-Kelly index is used to evaluate the spread of the degree of manipulability for Kelly’s, Gardenfors, and Expected utility weak extensions of agent’s preferences over the sets of alternatives. The results are obtained via computer simulations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research