For best experience please turn on javascript and use a modern browser!
You are using a browser that is no longer supported by Microsoft. Please upgrade your browser. The site may not present itself correctly if you continue browsing.

Dr. R. (Ronald) de Haan

Faculty of Science
ILLC
Visiting address
  • Science Park 900
  • Room number: L6.34
Postal address
  • Postbus 94242
    1090 GE Amsterdam
Contact details
  • Publications

    2023

    • Botan, S., de Haan, R., Slavkovik, M., & Terzopoulou, Z. (2023). Egalitarian judgment aggregation. Autonomous Agents and Multi-Agent Systems, 37(1), Article 16. https://doi.org/10.1007/s10458-023-09598-6
    • Pinto Prieto, D., de Haan, R., & Özgün, A. (2023). A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence. In P. Marquis, T. C. Son, & G. Kern-Isberner (Eds.), Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning: Rhodes, Greece. September 2-8, 2023 (pp. 552-561). (KR; Vol. 2023). IJCAI. https://doi.org/10.24963/kr.2023/54 [details]
    • Rey, S., Endriss, U., & de Haan, R. (2023). A general framework for participatory budgeting with additional constraints. Social Choice and Welfare. Advance online publication. https://doi.org/10.1007/s00355-023-01462-6
    • Wareham, T., de Haan, R., Vardy, A., & van Rooij, I. (2023). Swarm Control for Distributed Construction: A Computational Complexity Perspective. Transactions on Human-Robot Interaction, 12(1), Article 6. https://doi.org/10.1145/3555078 [details]

    2022

    • Aziz, H., Biró, P., Fleiner, T., Gaspers, S., de Haan, R., Mattei, N., & Rastegari, B. (2022). Stable Matching with Uncertain Pairwise Preferences. Theoretical Computer Science, 909, 1-11. https://doi.org/10.1016/j.tcs.2022.01.028 [details]
    • Boixel, A., Endriss, U., & de Haan, R. (2022). A Calculus for Computing Structured Justifications for Election Outcomes. In K. Sycara, V. Honavar, & M. Spaan (Eds.), Proceedings of the 36th AAAI Conference on Artificial Intelligence: AAAI-22 : virtual conference, Vancouver, Canada, February 22-March 1, 2022 (Vol. 5, pp. 4859-4866). AAAI Press. Advance online publication. https://doi.org/10.1609/aaai.v36i5.20414 [details]
    • Chingoma, J., Endriss, U., & de Haan, R. (2022). Simulating Multiwinner Voting Rules in Judgment Aggregation. In AAMAS '22: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems : May 9-13, 2022, virtual event, New Zealand (Vol. 1, pp. 263-271). International Foundation for Autonomous Agents and Multiagent Systems. https://dl.acm.org/doi/10.5555/3535850.3535881 [details]
    • Pinto Prieto, D., & de Haan, R. (2022). Using hierarchies to efficiently combine evidence with Dempster's rule of combination. Proceedings of Machine Learning Research, 180, 1634-1643. https://openreview.net/forum?id=H3zMYwUsqeq [details]

    2021

    • Boixel, A., & de Haan, R. (2021). On the Complexity of Finding Justifications for Collective Decisions. In AAAI-21, IAAI-21, EAAI-21 proceedings: a virtual conference, February 2-9, 2021 : Thirty-Fifth AAAI Conference on Artificial Intelligence, Thirty-Third Conference on Innovative Applications of Articicial Intelligence, Eleventh Symposium on Educational Advances in Artificial Intelligence (Vol. 6, pp. 5194-5201). (Proceedings of the AAAI Conference on Artificial Intelligence; Vol. 35). AAAI Press. https://doi.org/10.1609/aaai.v35i6.16656 [details]
    • Botan, S., de Haan, R., Slavkovik, M., & Terzopoulou, Z. (2021). Egalitarian Judgment Aggregation. In U. Endriss, A. Nowé, F. Dignum, & A. Lomuscio (Eds.), AAMAS '21: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems : May 3-7, 2021, virtual event, UK (Vol. 1, pp. 214-222). International Foundation for Autonomous Agents and Multiagent Systems. https://www.ifaamas.org/Proceedings/aamas2021/pdfs/p214.pdf [details]
    • Bracciali, A., Grossi, D., & de Haan, R. (2021). Decentralization in Open Quorum Systems: Limitative Results for Ripple and Stellar. In E. Anceaume, C. Bisière, M. Bouvard, Q. Bramas, & C. Casamatta (Eds.), 2nd International Conference on Blockchain Economics, Security and Protocols: Tokenomics 2020, October 26-27, 2020, Toulouse, France Article 5 (OASIcs - Open Access Series in Informatics; Vol. 82). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/OASIcs.Tokenomics.2020.5 [details]
    • Dorn, B., de Haan, R., & Schlotter, I. (2021). Obtaining a Proportional Allocation by Deleting Items. Algorithmica, 83(5), 1559–1603. https://doi.org/10.1007/s00453-020-00794-4 [details]
    • Rey, S., Endriss, U., & de Haan, R. (2021). Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting. In Z-H. Zhou (Ed.), Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence: IJCAI 2021, virtual event : Montreal, 19-27 August 2021 (pp. 370-376). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/52 [details]
    • Rich, P., Blokpoel, M., de Haan, R., Otworowska, M., Sweers, M., Wareham, T., & van Rooij, I. (2021). Naturalism, tractability and the adaptive toolbox. Synthese, 198(6), 5749–5784. https://doi.org/10.1007/s11229-019-02431-2 [details]
    • Rich, P., de Haan, R., Wareham, T., & van Rooij, I. (2021). How hard is cognitive science? In 43rd Annual Meeting of the Cognitive Science Society (CogSci 2021): Comparative Cognition Animal Minds : Vienna, Austria, 26-29 July 2021 (Vol. 5, pp. 3034-3040). (Proceedings of the Annual Meeting of the Cognitive Science Society; Vol. 43). Cognitive Science Society. https://escholarship.org/uc/item/8cr8x1c4 [details]
    • Woensdregt, M., Spike, M., de Haan, R., Wareham, T., van Rooij, I., & Blokpoel, M. (2021). Why is scaling up models of language evolution hard? In 43rd Annual Meeting of the Cognitive Science Society (CogSci 2021): Comparative Cognition Animal Minds : Vienna, Austria, 26-29 July 2021 (Vol. 1, pp. 209-215). (Proceedings of the Annual Meeting of the Cognitive Science Society; Vol. 43). Cognitive Science Society. https://escholarship.org/uc/item/021734q4 [details]

    2020

    2019

    • Aziz, H., Biro, P., de Haan, R., & Rastegari, B. (2019). Pareto Optimal Allocation under Compact Uncertain Preferences. In Thirty-Third AAAI Conference on Artificial Intelligence, Thirty-First Conference on Innovative Applications of Artificial Intelligence, The Ninth Symposium on Educational Advances in Artificial Intelligence: AAAI-19, IAAI-19, EAAI-20 : January 27-February 1, 2019, Hilton Hawaiian Village, Honolulu, Hawaii, USA (pp. 1740-1747). (Proceedings of the AAAI Conference on Artificial Intelligence; Vol. 33). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33011740 [details]
    • Aziz, H., Biró, P., de Haan, R., & Rastegari, B. (2019). Pareto Optimal Allocation under Uncertain Preferences: Uncertainty Models, Algorithms, and Complexity. Artificial Intelligence, 276, 57-78. Advance online publication. https://doi.org/10.1016/j.artint.2019.08.002 [details]
    • de Haan, R. (2019). Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy. (Lecture Notes in Computer Science; Vol. 11880), (FoLLI Publications on Logic, Language and Information). Springer. https://doi.org/10.1007/978-3-662-60670-4 [details]
    • de Haan, R., & Slavkovik, M. (2019). Answer Set Programming for Judgment Aggregation. In S. Kraus (Ed.), Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence: IJCAI-19 : Macao, 10-16 August 2019 (pp. 1668-1674). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2019/231 [details]
    • de Haan, R., & Szeider, S. (2019). A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Algorithms, 12(9), Article 188. https://doi.org/10.3390/a12090188 [details]
    • de Haan, R., & Szymanik, J. (2019). Characterizing polynomial Ramsey quantifiers. Mathematical Structures in Computer Science, 29(6), 896-908. Advance online publication. https://doi.org/10.1017/S0960129518000397 [details]
    • van Rooij, I., Blokpoel, M., de Haan, R., & Wareham, T. (2019). Tractable embodied computation needs embeddedness. Reti, Saperi, Linguaggi, 6(1), 25-38. https://doi.org/10.12832/94728, https://doi.org/10.12832/94728 [details]

    2018

    • Döcker, J., Dorn, B., Endriss, U., de Haan, R., & Schneckenburger, S. (2018). Tool Auctions. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, Thirtieth Innovative Applications of Artificial Intelligence Conference, Eighth Symposium on Educational Advances in Artificial Intelligence: 2-7 February 2018, New Orleans, Louisiana, USA (pp. 1015-1022). AAAI Press. https://aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/17186 [details]
    • de Haan, R. (2018). A Parameterized Complexity View on Description Logic Reasoning. In M. Thielscher, F. Toni, & F. Wolter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference (KR2018): Tempe, Arizona, 30 October-2 November 2018 (pp. 359-368). AAAI Press. https://arxiv.org/abs/1808.03852 [details]
    • de Haan, R. (2018). Hunting for Tractable Languages for Judgment Aggregation. In M. Thielscher, F. Toni, & F. Wolter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference (KR2018): Tempe, Arizona, 30 October-2 November 2018 (pp. 194-203). AAAI Press. https://arxiv.org/abs/1808.03043 [details]
    • de Haan, R., & Wolf, P. (2018). Restricted Power - Computational Complexity Results for Strategic Defense Games. In H. Ito, S. Leonardi, L. Pagli, & G. Prencipe (Eds.), 9th International Conference on Fun with Algorithms: FUN 2018, June 13-15, 2016, La Maddalena Island, Italy Article 17 (Leibniz International Proceedings in Informatics; Vol. 100). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FUN.2018.17 [details]

    2017

    • Aziz, H., Biró, P., Fleiner, T., Gaspers, S., de Haan, R., Mattei, N., & Rastegari, B. (2017). Stable Matching with Uncertain Pairwise Preferences. In S. Das, E. Durfee, K. Larson, & M. Winikoff (Eds.), AAMAS '17: proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems : May, 8-12, 2017, São Paulo, Brazil (Vol. 1, pp. 344-352). International Foundation for Autonomous Agents and Multiagent Systems. http://www.aamas-conference.org/Proceedings/aamas2017/pdfs/p344.pdf [details]
    • Aziz, H., de Haan, R., & Rastegari, B. (2017). Pareto Optimal Allocation under Compact Uncertain Preferences. In C. Sierra (Ed.), Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI-17): Melbourne, Australia, 19-25 August 2017 (pp. 77-83). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2017/12 [details]
    • Aziz, H., de Haan, R., & Rastegari, B. (2017). Pareto Optimal Allocation under Uncertain Preferences. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017): Melbourne, Australia 19-25 August 2017 (pp. 77-83). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2017/12 [details]
    • Aziz, H., de Haan, R., & Rastegari, B. (2017). Pareto Optimal Allocation under Uncertain Preferences. In S. Das, E. Durfee, K. Larson, & M. Winikoff (Eds.), AAMAS '17: proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems : May, 8-12, 2017, São Paulo, Brazil (Vol. 3, pp. 1472-1474 ). International Foundation for Autonomous Agents and Multiagent Systems. https://dl.acm.org/citation.cfm?id=3091333 [details]
    • Dorn, B., de Haan, R., & Schlotter, I. (2017). Obtaining a Proportional Allocation by Deleting Items. In J. Röthe (Ed.), Algorithmic Decision Theory: 5th International Conference, ADT 2017, Luxembourg, Luxembourg, October 25–27, 2017 : proceedings (pp. 284-299). (Lecture Notes in Computer Science; Vol. 10576), (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.1007/978-3-319-67504-6_20 [details]
    • de Haan, R. (2017). Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure. In S. Das, E. Durfee, K. Larson, & M. Winikoff (Eds.), AAMAS '17: proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems : May, 8-12, 2017, São Paulo, Brazil (Vol. 2, pp. 1151-1159). International Foundation for Autonomous Agents and Multiagent Systems. http://www.aamas-conference.org/Proceedings/aamas2017/pdfs/p1151.pdf [details]
    • de Haan, R., & Slavkovik, M. (2017). Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures. In S. Das, E. Durfee, K. Larson, & M. Winikoff (Eds.), AAMAS '17: proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems : May, 8-12, 2017, São Paulo, Brazil (Vol. 2, pp. 952-961). International Foundation for Autonomous Agents and Multiagent Systems. http://www.aamas-conference.org/Proceedings/aamas2017/pdfs/p952.pdf [details]
    • de Haan, R., & Szeider, S. (2017). Parameterized Complexity Classes Beyond para-NP. Journal of Computer and System Sciences, 87, 16-57. Advance online publication. https://doi.org/10.1016/j.jcss.2017.02.002 [details]
    • de Haan, R., Kanj, I., & Szeider, S. (2017). On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. ACM Transactions on Computational Logic, 18(3), Article 21. https://doi.org/10.1145/3091528 [details]

    2016

    2015

    • Endriss, U., & de Haan, R. (2015). Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young. In AAMAS '15: proceedings of the 2015 International Conference on Autonomous Agents & Multiagent Systems : May, 4-8, 2015, Istanbul, Turkey (Vol. 1, pp. 117-125). International Foundation for Autonomous Agents and Multiagent Systems. http://www.aamas-conference.org/Proceedings/aamas2015/aamas/p117.pdf [details]
    • Endriss, U., de Haan, R., & Szeider, S. (2015). Parameterized Complexity Results for Agenda Safety in Judgment Aggregation. In AAMAS '15: proceedings of the 2015 International Conference on Autonomous Agents & Multiagent Systems : May, 4-8, 2015, Istanbul, Turkey (Vol. 1, pp. 127-136). International Foundation for Autonomous Agents and Multiagent Systems. http://www.aamas-conference.org/Proceedings/aamas2015/aamas/p127.pdf [details]
    • de Haan, R., & Szymanik, J. (2015). A dichotomy result for Ramsey quantifiers. In V. de Paiva, R. de Queiroz, L. S. Moss, D. Leivant, & A. G. de Oliveira (Eds.), Logic, Language, Information, and Computation: 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015 : proceedings (pp. 69-80). (Lecture Notes in Computer Science; Vol. 9160), (FoLLI Publications on Logic, Language and Information). Springer. https://doi.org/10.1007/978-3-662-47709-0_6 [details]

    2021

    2020

    • Boixel, A., & de Haan, R. (2020). On the Complexity of Finding Justifications for Collective Decisions. Poster session presented at 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Rhodes, Greece.

    2024

    • Pinto Prieto, D. (2024). Combining uncertain evidence: Logic and complexity. [Thesis, fully internal, Universiteit van Amsterdam]. [details]

    2023

    • Rey, S. J. (2023). Variations on participatory budgeting. [Thesis, fully internal, Universiteit van Amsterdam]. [details]

    2021

    • Botan, S. (2021). Strategyproof social choice for restricted domains. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation. [details]
    This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library or the Pure staff of your faculty / institute. Log in to Pure to edit your publications. Log in to Personal Page Publication Selection tool to manage the visibility of your publications on this list.
  • Ancillary activities
    No ancillary activities
edit contact information   edit profile page