From post

On the Complexity of Predicting Election Outcomes and Estimating Their Robustness.

, и . EUMAS, том 12802 из Lecture Notes in Computer Science, стр. 228-244. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

How Hard Is the Manipulative Design of Scoring Systems?., и . IJCAI, стр. 74-80. ijcai.org, (2019)Complexity of control in judgment aggregation for uniform premise-based quota rules., , , , и . J. Comput. Syst. Sci., (2020)On the Complexity of Predicting Election Outcomes and Estimating Their Robustness., и . EUMAS, том 12802 из Lecture Notes in Computer Science, стр. 228-244. Springer, (2021)Distortion in Attribute Approval Committee Elections., и . AAMAS, стр. 2649-2651. ACM, (2023)Voter Dissatisfaction in Committee Elections., и . AAMAS, стр. 1707-1708. ACM, (2015)Complexity of Scheduling and Predicting Round-Robin Tournaments., и . AAMAS, стр. 178-186. ACM, (2021)Irresolute Approval-based Budgeting., , и . AAMAS, стр. 1774-1776. International Foundation for Autonomous Agents and Multiagent Systems, (2020)Complexity of Manipulative Interference in Participatory Budgeting., , и . ADT, том 13023 из Lecture Notes in Computer Science, стр. 424-439. Springer, (2021)The possible winner with uncertain weights problem., , , , , , и . J. Comput. Syst. Sci., (декабря 2023)Winner Determination and Manipulation in Minisum and Minimax Committee Elections., , и . ADT, том 9346 из Lecture Notes in Computer Science, стр. 469-485. Springer, (2015)