Matan Gilboa : Publications
-
[1]
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
-
[2]
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
-
[3]
Single−Deviation Stability in Additively Separable Hedonic Games with Constrained Coalition Sizes
Martin Bullinger‚ Adam Dunajski‚ Edith Elkind and Matan Gilboa
2025.
Details about Single−Deviation Stability in Additively Separable Hedonic Games with Constrained Coalition Sizes | BibTeX data for Single−Deviation Stability in Additively Separable Hedonic Games with Constrained Coalition Sizes | Link to Single−Deviation Stability in Additively Separable Hedonic Games with Constrained Coalition Sizes
-
[4]
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
-
[5]
Complexity of Public Goods Games on Graphs
Matan Gilboa and Noam Nisan
In 15th International Symposium on Algorithmic Game Theory (SAGT 2022). Pages 151–168. Springer International Publishing. 2022.
Details about Complexity of Public Goods Games on Graphs | BibTeX data for Complexity of Public Goods Games on Graphs