( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
How Hard Is the Manipulative Design of Scoring Systems?.

, и . IJCAI, стр. 74-80. ijcai.org, (2019)

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.

Hubert Hogrebe

Wilhelm Hogrebe

Joachim Hogrebe

Frank Hogrebe

Edmund Hogrebe

 

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

How Hard Is the Manipulative Design of Scoring Systems?., и . IJCAI, стр. 74-80. ijcai.org, (2019)On the Complexity of Predicting Election Outcomes and Estimating Their Robustness., и . EUMAS, том 12802 из Lecture Notes in Computer Science, стр. 228-244. Springer, (2021)On the Complexity of Predicting Election Outcomes and Estimating Their Robustness., и . SN Comput. Sci., 4 (4): 362 (июля 2023)Generalized Distance Bribery., , и . AAAI, стр. 1764-1771. AAAI Press, (2019)Towards Reality: Smoothed Analysis in Computational Social Choice., , и . AAMAS, стр. 1691-1695. International Foundation for Autonomous Agents and Multiagent Systems, (2020)Manipulative Design of Scoring Systems., и . AAMAS, стр. 1814-1816. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Complexity of Distances in Elections: Doctoral Consortium.. AAMAS, стр. 2414-2416. International Foundation for Autonomous Agents and Multiagent Systems, (2019)From Elections to Tournaments: A Study of the Computational Complexity of Bribery, Design, and Prediction Problems in Voting and Sports.. Heinrich-Heine-Universität, Düsseldorf, Germany, (2023)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)