Voor de beste ervaring schakelt u JavaScript in en gebruikt u een moderne browser!
Je gebruikt een niet-ondersteunde browser. Deze site kan er anders uitzien dan je verwacht.

Dr. R. (Ronald) de Haan

Faculteit der Natuurwetenschappen, Wiskunde en Informatica
ILLC
Bezoekadres
  • Science Park 900
  • Kamernummer: L6.34
Postadres
  • Postbus 94242
    1090 GE Amsterdam
Contactgegevens
  • Publicaties

    2022

    • Boixel, A., Endriss, U., & Haan, R. D. (2022). A Calculus for Computing Structured Justifications for Election Outcomes. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI-2022) (pp. 4859-4866). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20414
    • Chingoma, J., Endriss, U., & de Haan, R. (2022). Simulating Multiwinner Voting Rules in Judgment Aggregation. In International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022 (pp. 263-271). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p263.pdf
    • 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. https://proceedings.mlr.press/v180/pinto-prieto22a/pinto-prieto22a.pdf
    • Wareham, T., de Haan, R., Vardy, A., & van Rooij, I. (2022). Swarm Control for Distributed Construction: A Computational Complexity Perspective. Transactions on Human-Robot Interaction. https://doi.org/10.1145/3555078

    2021

    • 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 [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]
    • 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]

    2020

    • Aziz, H., Biró, P., Gaspers, S., de Haan, R., Mattei, N., & Rastegari, B. (2020). Stable Matching with Uncertain Linear Preferences. Algorithmica, 82(5), 1410–1433. https://doi.org/10.1007/s00453-019-00650-0 [details]
    • Endriss, U., de Haan, R., Lang, J., & Slavkovik, M. (2020). The Complexity Landscape of Outcome Determination in Judgment Aggregation. Journal of Artificial Intelligence Research, 69, 687–731. https://doi.org/10.1613/jair.1.11970 [details]
    • Ganian, R., de Haan, R., Kanj, I., & Szeider, S. (2020). On Existential MSO and its Relation to ETH. ACM Transactions on Computation Theory, 12(4), [22]. https://doi.org/10.1145/3417759 [details]
    • Rey, S., Endriss, U., & de Haan, R. (2020). Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation. In D. Calvanese, E. Erdem, & M. Thielscher (Eds.), KR2020 : Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning: Rhodes, Greece, September 12-18, 2020 (pp. 692-702). IJCAI. https://doi.org/10.24963/kr.2020/71 [details]
    • Rich, P., Blokpoel, M., de Haan, R., & van Rooij, I. (2020). How Intractability Spans the Cognitive and Evolutionary Levels of Explanation. Topics in Cognitive Science, 12(4), 1382-1402. https://doi.org/10.1111/tops.12506 [details]
    • de Haan, R., & van de Pol, I. P. A. (Accepted/In press). On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models. IfCoLoG Journal of Logics and their Applications.

    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. 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), [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. 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 [17] (Leibniz International Proceedings in Informatics; Vol. 100). Saarbrücken/Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 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). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems. [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 ). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems. [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). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems. [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). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems. [details]
    • de Haan, R., & Szeider, S. (2017). Parameterized Complexity Classes Beyond para-NP. Journal of Computer and System Sciences, 87, 16-57. 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), [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.

    2021

    • Botan, S. (2021). Strategyproof social choice for restricted domains. 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.
  • Nevenwerkzaamheden
    Geen nevenwerkzaamheden
contactgegevens bewerken   bewerk profielinformatie