( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Winner Determination and Manipulation in Minisum and Minimax Committee Elections.

, , и . ADT, том 9346 из Lecture Notes in Computer Science, стр. 469-485. Springer, (2015)

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.

Dorothea Baumeister

Walter Baumeister

Georg Baumeister

Johannes Baumeister

Reinhold Baumeister

 

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

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)Complexity of Manipulative Interference in Participatory Budgeting., , и . ADT, том 13023 из Lecture Notes in Computer Science, стр. 424-439. Springer, (2021)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)Irresolute Approval-based Budgeting., , и . AAMAS, стр. 1774-1776. International Foundation for Autonomous Agents and Multiagent Systems, (2020)Complexity of Scheduling and Predicting Round-Robin Tournaments., и . AAMAS, стр. 178-186. ACM, (2021)Voter Dissatisfaction in Committee Elections., и . AAMAS, стр. 1707-1708. ACM, (2015)On the Average-Case Complexity of Predicting Round-Robin Tournaments., и . AAMAS, стр. 1542-1544. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)Complexity of Election Evaluation and Probabilistic Robustness: Extended Abstract., и . AAMAS, стр. 1771-1773. International Foundation for Autonomous Agents and Multiagent Systems, (2020)