资源论文Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities

Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities

2019-11-18 | |  73 |   49 |   0
Abstract Voting rules are powerful tools that allow multiple agents to aggregate their preferences in order to reach joint decisions. A common flaw of some voting rules, known as the no-show paradox, is that agents may obtain a more preferred outcome by abstaining from an election. We study strategic abstention for set-valued voting rules based on Kelly’s and Fishburn’s preference extensions. Our contribution is twofold. First, we show that, whenever there are at least five alternatives, every Paretooptimal majoritarian voting rule suffers from the no-show paradox with respect to Fishburn’s extension. This is achieved by reducing the statement to a finite—yet very large—problem, which is encoded as a formula in propositional logic and then shown to be unsatisfiable by a SAT solver. We also provide a human-readable proof which we extracted from a minimal unsatisfiable core of the formula. Secondly, we prove that every voting rule that satisfies two natural conditions cannot be manipulated by strategic abstention with respect to Kelly’s extension. We conclude by giving examples of well-known Pareto-optimal majoritarian voting rules that meet these requirements.

上一篇:Optimal Incremental Preference Elicitation during Negotiation

下一篇:Efficiency and Complexity of Price Competition among Single-Product Vendors

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Joint Pose and Ex...

    Facial expression recognition (FER) is a challe...