Matchings under Preferences: Strength of Stability and Trade-Offs
Chen, J., Skowron, P., Sorge, M. ACM Transactions on Economics and Computation. 6 (4), 1–55 (2022).
[link]
Participatory Budgeting with Donation and Diversity Constraints
Chen, J., Lackner, M., Maly, J. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI ’22). pp. 9323–9330 (2022).
2-Dimensional Euclidean Preferences
Bulteau, L., Chen, J. arXiv:2205.14687 (2022).
[link]
Cores in Friend-Oriented Hedonic Games: Verification is Surprisingly Harder than Searching
Chen, J., Csáji, G., Roy, S., Simola, S. arXiv:2203.09655 (2022).
[link]
Multidimensional Manhattan Preferences
Chen, J., Nöllenburg, M., Simola, S., Villedieu, A., Wallinger, M. arXiv:2201.09691 (2022).
[link]
Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule
Chen, J., Roy, S. arXiv:2202.12006 (2022).
[link]
Multidimensional Manhattan Preferences
Chen, J., Nöllenburg, M., Simola, S., Villedieu Anaı̈s, Wallinger, M. In: Proceedings of the 14th Latin American Symposium (LATIN ’22) (2022).
Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space
Chen, J., Roy, S. In: Proceedings of the 30th Annual European Symposium on Algorithms (ESA ’22). pp. 36:1–36:16 (2022).
Small One-Dimensional Euclidean Preference Profiles
Chen, J., Grottke, S. Social Choice and Welfare. 57 (1), 117–144 (2021).
[link]
Fractional Matchings under Preferences: Stability and Optimality
Chen, J., Roy, S., Sorge, M. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI ’21). pp. 796–809 (2021).
[link]
Participatory Budgeting with Donation and Diversity Constraints
Chen, J., Lackner, M., Maly, J. arXiv:2104.15075 (2021).
[link]
Gerrymandering on graphs: Computational complexity and parameterized algorithms
Gupta, S., Jain, P., Panolan, F., Roy, S., Saurabh, S. In: Proceedings of the 14th International Symposium on Algorithmic Game Theory (SAGT ’21). pp. 1–15 (2021).
Euclidean 3D Stable Roommates is NP-hard
Chen, J., Roy, S. arXiv:2108.03868 (2021).
[link]
On (Coalitional) Exchange-Stable Matching
Chen, J., Chmurovic, A., Jogl, F., Sorge, M. In: Proceedings of the 14th International Symposium on Algorithmic Game Theory (SAGT ’21). pp. 205–220 (2021).
Adapting Stable Matchings to Evolving Preferences
Bredereck, R., Chen, J., Knop, D., Luo, J., Niedermeier, R. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI ’20). pp. 1830–1837 (2020).
[link]
Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences
Bredereck, R., Chen, J., Finnendahl, U.P., Niedermeier, R. Autonomous Agents and Multi-Agent Systems. 34 (53), 1–29 (2020).
[link]
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
Chen, J., Ganian, R., Hamm, T. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI ’20). pp. 146–152 (2020).
[link]
[poster]
Fractional Matchings under Preferences: Stability and Optimality
Chen, J., Roy, S., Sorge, M. arXiv:2011.12259 (2020).
Reaching Stable Marriage via Divorces is Hard
Chen, J. arXiv:1906.12274v5 (2020).