Voting in Combinatorial Domains

Voting in Combinatorial Domains
复制标题

在组合域中投票

DOI:
--
复制
发表时间:
2016
期刊:
Handbook of Computational Social Choice
影响因子:
--
通讯作者:
Lirong Xia
Lirong Xia
中科院分区:
--
文献类型:
--
作者:
J. Lang;Lirong Xia

文献摘要

被引文献

相似文献

本章介绍有限域值的笛卡尔产品(或有时是笛卡尔产品子集的域)的偏好汇总和投票,每个产品对应于问题,变量或属性。如本手册的其他章节所示,投票规则映射了一个配置文件(通常是排名集合,请参见第1章),以替代或一组替代方案。一个关键问题与一组替代方案的结构有关。有时,这套场景具有简单的结构和小的基础性(例如,在总统大选中)。但是在许多情况下,它具有复杂的组合结构。
This chapter addresses preference aggregation and voting on domains which are the Cartesian product (or sometimes, a subset of the Cartesian product) of finite domain values, each corresponding to an issue, a variable, or an attribute. As seen in other chapters of this handbook, voting rules map a profile (usually, a collection of rankings, see Chapter 1) to an alternative or a set of alternatives. A key question has to do with the structure of the set of alternatives. Sometimes, this set has a simple structure and a small cardinality (e.g., in a presidential election). But in many contexts, it has a complex combinatorial structure.