Martin Bullinger

E-Mail: martin.bullinger@in.tum.de
Phone: +49 (0) 89 289 - 17537
Office:Room 01.10.040
Boltzmannstr. 3
85748 Munich, Germany
Hours: by arrangement

Short Bio

I am a PhD student in the group of Felix Brandt since February 2019. I received my master's degree at Technische Universität München in 2019. In my master's thesis, I set up a taxonomy of computational properties of local search problems.

My research interests encompass topics related to computational social choice, algorithmic game theory, and computational complexity. In my own research, I cover various scenarios in multi-agent systems with a focus on coalition formation, for which I study desirable outcomes measured, for instance, by Pareto optimality, individual stability, or popularity. While most of my methods concern their efficient computability and computational boundaries, I am also intrigued by the socio-scientific and philosophical perspective.

Publications

F. Brandt, M. Bullinger, and L. Tappe. Single-agent dynamics in additively separable hedonic games. 2021. Working paper. [ pdf ]

M. Bullinger, W. Suksompong, and A. Voudouris. Welfare guarantees in Schelling segregation. Journal of Artificial Intelligence Research, 71:143–174, 2021. [ link | pdf ]

M. Bullinger and S. Kober. Loyalty in cardinal hedonic games. In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), pages 66–72, 2021. [ link | pdf | venue ]

M. Bullinger. Computing desirable outcomes in specific multi-agent scenarios (doctoral consortium). In Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 1799–1801, 2021. [ link | venue ]

F. Brandt, M. Bullinger, and P. Lederer. On the indecisiveness of Kelly-strategyproof social choice functions. In Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 251–259, 2021. [ link | pdf | venue ]

F. Brandt, M. Bullinger, and A. Wilczynski. Reaching individually stable coalition structures in hedonic games. In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), pages 5211–5218, 2021. [ link | pdf | venue ]

F. Brandt, M. Bullinger, and A. Wilczynski. Reaching individually stable coalition structures in hedonic games. 2021. Working paper. [ pdf ]

M. Bullinger, W. Suksompong, and A. Voudouris. Welfare guarantees in Schelling segregation. In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), pages 5236–5243, 2021. [ link | venue ]

F. Brandt and M. Bullinger. Finding and recognizing popular coalition structures. 2021. Working paper. [ pdf ]

F. Brandt and M. Bullinger. Finding and recognizing popular coalition structures. In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 195–203, 2020. [ link | pdf | venue ]

M. Bullinger. Pareto-optimality in cardinal hedonic games. In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 213–221, 2020. [ link | pdf | venue ]

M. Bullinger. Computing desirable partitions in coalition formation games (doctoral consortium). In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 2185–2187, 2020. [ link | pdf | venue ]

Teaching

Courses
  • Algorithmic Game Theory (SS 2019, SS 2020, SS2021)
  • Discrete Structures (WS 2019/20, WS 2020/21)
  • Seminar on Economics and Computation (SS 2019)
  • Seminar on Markets, Algorithms, Incentives, and Networks (WS 2018/19, WS 2019/20, WS 2020/21, WS2021/22)
Student Projects
  • Master's thesis  Applying the Multiplicative Weights Update Method to Symmetric Zero-Sum Games (Samareh Fazeli Arya, in progress)
  • Master's thesis  Welfare Objectives in Schelling Segregation (Hannes Rittweger, 2021)
  • Master's thesis  Capabilities and Limitations of Dynamics in Coalition Formation (Felix Bergmann, 2021)
  • Master's thesis  Stability in Coalition Formation Games Based on Single-Agent Deviations (Leo Tappe, 2021)
  • Bachelor's thesis  Determining the Value of Ultimate TicTacToe (Evghenii Beriozchin, 2020)
  • Master's thesis  Discrete Donor Coordination (Matthias Greger, 2020)
  • Guided Research  Towards Solving Connect Four 3D (René Romen, 2020)
  • Master's thesis  Kelly-Strategyproof Social Choice Functions (Patrick Lederer, 2020)
  • Master's thesis  Determining Values of (m,n,k)-Games (Manuel Neuberger, 2019)