Matthias Oberlechner
| E-Mail: matthias.oberlechner@tum.de |
| Phone: +49 (0) 89 289 - 17532 |
| Office: Room 01.10.054 Boltzmannstr. 3 85748 Munich, Germany |
Hours: by arrangement
Short Bio
I'm a Ph.D. student at the DSS chair supervised by Prof. Bichler. My research focuses on the computation of equilibrium strategies in incomplete information games using methods from convex optimization.
| since 11/2020 | Associated Member of the DFG Research Training Group AdONE (TUM) |
| since 09/2020 | Research Assistant, Chair of Decision Sciences & Systems, TUM (Munich, Germany) |
| 04/2017 - 06/2020 | M.Sc. Mathematics, TUM (Munich, Germany) |
| 08/2018 - 01/2019 | Erasmus Student at Uppsala University (Uppsala, Sweden) |
| 10/2013 - 01/2017 | B.Sc. Mathematics, TUM (Munich, Germany) |
Publications
Journal Publications
- M. Bichler, N. Kohring, M. Oberlechner, F. Pieroth. Learning equilibrium in bilateral bargaining games. European Journal of Operational Research, 2022 (link)
Working Papers
- Fichtl, M, Oberlechner, M, Bichler, M. Computing Bayes Nash Equilibrium Strategies in Auction Games via Simultaneous Online Dual Averaging (arXiv)
Previous versions were presented in the Workshop on Reinforcement Learning in Games (AAAI-RLG 22, Online) and in the Workshop on Learning in Presence of Strategic Behavior (NeurIPS21, Online)
Teaching
Classes
- Operations Research (IN0024) - SS21, SS22, SS23
- Auction Theory and Market Design (IN2211) - WS21/22, WS22/23
Supervised Theses
- Learning Discrete Equilibrium Strategies in Auction Games
Master Thesis, Robotics, Cognition, Intelligence, 2022 - Visualisation of different Learning Algorithms in Matrix Games
Bachelor Thesis, Information Systems, 2022 - Multiplicative Weights Update in Congestion Games
Bachelor Thesis, Information Systems, 2022 - Solving the CVRPTW: Quantum Annealing vs. Exact Optimization
Master Thesis, Mathematics, 2022 - Visualization of Different Equilibrium Concepts in Matrix Games
Bachelor Thesis, Information Systems, 2022 - A Comparison of No-External-Regret and No-Internal-Regret Learning Algorithmis in Matrix Games
Bachelor Thesis, Informatics, 2022 - No-Regret Learning in Finite Games
Bachelor Thesis, Information Systems, 2022 - Stable Marriage Problem: Fair Algorithms and Applications
Bachelor Thesis, Information Systems, 2021
For available theses topics, check out this page.