arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.7244cs.GTcs.AI
收藏

Condorcet投票的代数和工具支持控制

Relation-algebraic and Tool-supported Control of Condorcet Voting

Christian-Albrechts-Universität Kiel(基尔大学)

Rudolf Berghammer, Henning Schnoor

摘要:

我们提出了一个孔多塞投票的关系代数模型,并在此基础上,通过删除选民的建设性控制问题的关系代数解决方案。我们认为两个获胜的条件,即。是一个孔多塞冠军,并在(吉勒分别。向上)未覆盖的集合。对于第一个条件,控制问题是NP-难的;对于第二个条件,控制问题的NP-难性在本文中示出。所有的关系代数规范,我们将在文件中立即开发可以翻译成程序设计语言的BDD为基础的计算机系统RelView。我们的方法非常灵活,特别适合原型设计和实验,因此对于教育目的非常有指导意义。它可以很容易地应用到其他的投票规则和控制问题。

英文摘要:

We present a relation-algebraic model of Condorcet voting and, based on it, relation-algebraic solutions of the constructive control problem via the removal of voters. We consider two winning conditions, viz. to be a Condorcet winner and to be in the (Gilles resp. upward) uncovered set. For the first condition the control problem is known to be NP-hard; for the second condition the NP-hardness of the control problem is shown in the paper. All relation-algebraic specifications we will develop in the paper immediately can be translated into the programming language of the BDD-based computer system RelView. Our approach is very flexible and especially appropriate for prototyping and experimentation, and as such very instructive for educational purposes. It can easily be applied to other voting rules and control problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑