Determining Possible and Necessary Winners Given Partial Orders
From MaRDI portal
Publication:3007558
DOI10.1613/jair.3186zbMath1218.91040arXiv1401.3876OpenAlexW1611302770WikidataQ129517944 ScholiaQ129517944MaRDI QIDQ3007558
Publication date: 16 June 2011
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3876
Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other applications of logic (03B80)
Related Items (32)
Ranking chain sum orders ⋮ The possible winner problem with uncertain weights revisited ⋮ Manipulative elicitation -- a new attack on elections with incomplete preferences ⋮ Manipulation of k-Approval Under De Re Knowledge ⋮ Studies in Computational Aspects of Voting ⋮ Prices matter for the parameterized complexity of shift bribery ⋮ Weighted partial order oriented three-way decisions under score-based common voting rules ⋮ The possible winner with uncertain weights problem ⋮ Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules ⋮ On the complexity of bribery and manipulation in tournaments with uncertain information ⋮ Bribery in voting with CP-nets ⋮ On the exact amount of missing information that makes finding possible winners hard ⋮ Fixing balanced knockout and double elimination tournaments ⋮ New candidates welcome! Possible winners with respect to the addition of new candidates ⋮ Local distance constrained bribery in voting ⋮ Stability, optimality and manipulation in matching problems with weighted preferences ⋮ Verification in incomplete argumentation frameworks ⋮ Approximation and hardness of shift-Bribery ⋮ Complexity of manipulation with partial information in voting ⋮ Robust winner determination in positional scoring rules with uncertain weights ⋮ Reaching a joint decision with minimal elicitation of voter preferences ⋮ Campaign management under approval-driven voting rules ⋮ A distributed social choice protocol for combinatorial domains ⋮ Multivariate complexity analysis of Swap Bribery ⋮ On the evaluation of election outcomes under uncertainty ⋮ A parameterized perspective on protecting elections ⋮ Preference elicitation and robust winner determination for single- and multi-winner social choice ⋮ Distributed monitoring of election winners ⋮ Optimizing positional scoring rules for rank aggregation ⋮ On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard ⋮ Computing possible and certain answers over order-incomplete data ⋮ Complexity of shift bribery for iterative voting rules
This page was built for publication: Determining Possible and Necessary Winners Given Partial Orders
