 |
Martin Bullinger |
|
|
Department of Informatics (I18)
Technical University of Munich
|
||
|
|
||
| E-Mail: | This email address is being protected from spambots. You need JavaScript enabled to view it. | |
| Office: |
Room 01.10.040
Boltzmannstr. 3
85748 München, Germany
|
|
| Phone: | +49 (0) 89 289 - 17537 | |
| 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 transferred theory from combinatorial optimization to local search algorithms.
In my research, I want to apply methods from different areas of mathematics such as optimization or topology to find out more about the interrelations of Algorithmic Game Theory and Computational Social Choice.
Publications
M. Bullinger.
Pareto-optimality in graph-based hedonic games.
In Proceedings of the 19th International Conference on
Autonomous Agents and Multiagent Systems (AAMAS). IFAAMAS, 2020.
Forthcoming.
[ 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). IFAAMAS, 2020.
Forthcoming.
[ pdf ]
Teaching
Courses
- Algorithmic Game Theory (SS 2019)
- Discrete Structures (WS 2019/20)
- Economics and Computation (SS 2019)
- Seminar on Markets, Algorithms, Incentives, and Networks (WS 2018/19, WS 2019/20)
Student Projects
- Master's thesis Determining Values of (m,n,k)-Games (Manuel Neuberger, 2019)
- Master's thesis Kelly-Strategyproof Social Choice Functions (Patrick Lederer, in progress)
- Guided Research Towards Solving Connect Four 3D (René Romen, in progress)