On the exact amount of missing information that makes finding possible winners hard

DOI10.1016/J.JCSS.2023.02.003OpenAlexW2541215332MaRDI QIDQ2698287

Neeldhara Misra, Palash Dey

Publication date: 21 April 2023

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2023.02.003

zbMATH Keywords

complexityalgorithmvotingpartial ordertheorycomputational social choicepossible winnerincomplete votes

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
• New candidates welcome! Possible winners with respect to the addition of new candidates
• Kernelization complexity of possible winner and coalitional manipulation problems in voting
• Towards a dichotomy for the possible winner problem in elections based on scoring rules
• Determining Possible and Necessary Winners Given Partial Orders
• Partial Kernelization for Rank Aggregation: Theory and Experiments
• Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
• On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard
• Handbook of Computational Social Choice
• Parameterized Algorithms

This page was built for publication: On the exact amount of missing information that makes finding possible winners hard