( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting.

, , и . CoRR, (2020)

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.

Nathalie de Haan

Martha Lanwer-de Haan

Annemarie Haan

Arnim Haan

Thomas Haan

 

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

Decentralization in Open Quorum Systems., , и . CoRR, (2019)On Existential MSO and its Relation to ETH., , , и . MFCS, том 58 из LIPIcs, стр. 42:1-42:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Parameterized complexity classes beyond para-NP., и . J. Comput. Syst. Sci., (2017)Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting., , и . CoRR, (2020)Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity., , , и . Artif. Intell., (2019)The Complexity Landscape of Outcome Determination in Judgment Aggregation., , , и . J. Artif. Intell. Res., (2020)On the Complexity of Finding Justifications for Collective Decisions., и . AAAI, стр. 5194-5201. AAAI Press, (2021)Simulating Multiwinner Voting Rules in Judgment Aggregation., , и . AAMAS, стр. 263-271. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young., и . AAMAS, стр. 117-125. ACM, (2015)Parameterized Complexity in the Polynomial Hierarchy - Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy. Lecture Notes in Computer Science Springer, (2019)