Matan Gilboa
Matan Gilboa
Wolfson Building, Parks Road, Oxford OX1 3QD
Biography
I am a second year Ph.D. student in Computer Science. My research is in computational complexity and algorithmic game theory. I am a tutor for the course Computational Game Theory of the CS department.
I completed my MSc in Mathematics and Foundations of Computer Science (MFoCS) at the University of Oxford, and my BSc in Computer Science at the Hebrew University of Jerusalem.
Selected Publications
-
Complexity of Unambiguous Problems in Sigma^P_2
Matan Gilboa‚ Paul W. Goldberg‚ Elias Koutsoupias and Noam Nisan
2025.
Details about Complexity of Unambiguous Problems in Sigma^P_2 | BibTeX data for Complexity of Unambiguous Problems in Sigma^P_2 | Link to Complexity of Unambiguous Problems in Sigma^P_2
-
Settling the Complexity of Popularity in Additively Separable and Fractional Hedonic Games
Martin Bullinger and Matan Gilboa
In Proceedings of the Thirty−Fourth International Joint Conference on Artificial Intelligence‚ IJCAI−25. Pages 3771–3779. International Joint Conferences on Artificial Intelligence Organization. August, 2025.
Main Track
Details about Settling the Complexity of Popularity in Additively Separable and Fractional Hedonic Games | BibTeX data for Settling the Complexity of Popularity in Additively Separable and Fractional Hedonic Games | DOI (10.24963/ijcai.2025/419) | Link to Settling the Complexity of Popularity in Additively Separable and Fractional Hedonic Games
-
A Characterization of Complexity in Public Goods Games
Matan Gilboa
In 51st International Colloquium on Automata‚ Languages‚ and Programming (ICALP 2024). Vol. 297 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 73:1–73:19. Dagstuhl‚ Germany. 2024. Schloss Dagstuhl – Leibniz−Zentrum für Informatik.
Details about A Characterization of Complexity in Public Goods Games | BibTeX data for A Characterization of Complexity in Public Goods Games | DOI (10.4230/LIPIcs.ICALP.2024.73) | Link to A Characterization of Complexity in Public Goods Games