کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
972762 932679 2009 21 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Sequential composition of voting rules in multi-issue domains
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
Sequential composition of voting rules in multi-issue domains
چکیده انگلیسی
In many real-world group decision making problems, the set of alternatives is a Cartesian product of finite value domains for each of a given set of variables (or issues). Dealing with such domains leads to the following well-known dilemma: either ask the voters to vote separately on each issue, which may lead to the so-called multiple election paradoxes as soon as voters' preferences are not separable; or allow voters to express their full preferences on the set of all combinations of values, which is practically impossible as soon as the number of issues and/or the size of the domains are more than a few units. We try to reconciliate both views and find a middle way, by relaxing the extremely demanding separability restriction into this much more reasonable one: there exists a linear order x1>⋯>xp on the set of issues such that for each voter, every issue xi is preferentially independent of xi+1,…,xp given x1,…,xi−1. This leads us to define a family of sequential voting rules, defined as the sequential composition of local voting rules. These rules relate to the setting of conditional preference networks (CP-nets) recently developed in the Artificial Intelligence literature. Lastly, we study in detail how these sequential rules inherit, or do not inherit, the properties of their local components.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Mathematical Social Sciences - Volume 57, Issue 3, May 2009, Pages 304-324
نویسندگان
, ,