Algorithms & Complexity

Group

Research

Teaching

Theses

Martin Hoefer Goethe-Universität Frankfurt am Main Institut für Informatik Robert-Mayer-Straße 11-15, Room 115 D-60325 Frankfurt am Main, Germany Phone: +49 69 798 28119 (Secretary: Marta Soares) Phone: +49 69 798 28155 Email: m[lastname] [AT] em.uni-frankfurt.de Office hours: By appointment

I am not offering internships. Please excuse that I am not responding to such email requests.

---

Brief CV

• Professor, Goethe University Frankfurt, Germany (since 2016)
• Research Group Leader, Saarland University, Germany (2012-2016)
  Senior Researcher, MPI Informatik, Germany (2013-2016)
• Assistant Professor, RWTH Aachen University, Germany (2011-2012)
• PostDoc, Stanford University, USA (2008)
• Research Associate, RWTH Aachen University, Germany (2007-2011)
• Doctorate (Dr.rer.nat) in Computer Science, University of Konstanz, Germany (2007)
• Diplom (Dipl.-Inf.) in Computer Science, TU Clausthal, Germany (2004)

---

Activities

• Spokesman of DFG Research Unit ADYN (since 2020).

• Conference/Workshop Organization:

  Computational Social Dynamics (Dagstuhl Seminar), WINE 2020 (Program Co-Chair), SAGT 2015 (Program and Conference Chair)

• Program Committees:

  AAMAS'23 (SPC), EC'23 (AC), AAMAS'22 (SPC), EC'22 (AC), ESA'22, MATCH-UP'22, STACS'22, WINE'22 (SPC), IJCAI'21 (SPC), ICALP-A'20, IJCAI-PRICAI'20 (SPC), SAGT'20, WINE'20, MATCH-UP'19, SAGT'19, SODA'19, WADS'19, WINE'19, EC'18 (SPC), SAGT'18, ESA'17, MATCH-UP'17, SPAA'17, STACS'17, ICALP-C'16, MFCS'16, SAGT'15, SPAA'15, SAGT'14, SPAA'14, WINE'14, CATS'13, AAIM'12, ESA'12, SAGT'12, SPAA'12, WAOA'12, WINE'12, WINE'11

  Reviewer-PC: AAAI (21, 20, 18-16), AAMAS (15), EC (21-19, 17, 14, 12, 11), IJCAI (22)

---

Research

I am broadly interested in design and analysis of efficient algorithms and computational complexity of decision, optimization and search problems. A special focus of my work are coordination problems in distributed systems, especially in algorithmic game theory, in computational learning theory and optimization with uncertainty.

---

Publications

Complete List, see also DBLP or Google Scholar.

Some Recent Work

• Hoefer, Wilhelmi. Seniorities and Minimal Clearing in Financial Network Games. SAGT 2022.
• Griesbach, Hoefer, Klimm, Koglin. Public Signals in Network Congestion Games. EC 2022.
• Berenbrink, Hoefer, Kaaser, Lenzner, Rau, Schmand. Asynchronous Opinion Dynamics in Social Networks. AAMAS 2022.
• Akrami, Chaudhury, Hoefer, Mehlhorn, Schmalhofer, Shahkarami, Varricchio, Vermande, van Wijland. Maximizing Nash Social Welfare in 2-Value Instances. AAAI 2022.
• Gradwohl, Hahn, Hoefer, Smorodinsky. Reaping the Informational Surplus in Bayesian Persuasion. AEJ Micro. (→ video)

Further Selected Works

• Gradwohl, Hahn, Hoefer, Smorodinsky. Algorithms for Persuasion with Limited Communication. SODA 2021 / MOR 2022.
• Hahn, Hoefer, Smorodinsky. The Secretary Recommendation Problem. EC 2020 / GEB 2022. (→ video)
• Garg, Hoefer, Mehlhorn. Approximating the Nash Social Welfare with Budget-Additive Valuations. SODA 2018.
• Hoefer, Kodric. Combinatorial Secretary Problems with Ordinal Information. ICALP 2017.
• Bei, Garg, Hoefer. Ascending-Price Algorithms for Unknown Markets. EC 2016 / ACM TALG 2019.
• Chen, Hoefer, Künnemann, Lin, Miao. Secretary Markets with Local Information. ICALP 2015 / Distrib. Comput. 2019
• Azar, Hoefer, Maor, Reiffenhäuser, Vöcking. Truthful Mechanism Design via Correlated Tree Rounding. EC 2015 / Math. Prog. 2017.
• Hoefer, Vaz, Wagner. Dynamics in Matching and Coalition Formation Games with Structural Constraints. AAAI 2015, WINE 2014 / Artif. Intell. 2018
• Göbel, Hoefer, Kesselheim, Schleiden, Vöcking. Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. ICALP 2014 (Best Paper Track C).
• Hoefer. Local Matching Dynamics in Social Networks. ICALP 2011 (Best Paper Track C) / Inf. Comput. 2013.
• Berenbrink, Hoefer, Sauerwald. Distributed Selfish Load Balancing on Networks. SODA 2011 / ACM TALG 2014.
• Harks, Hoefer, Klimm, Skopalik. Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games. ESA 2010 / Math. Prog. 2013.
• Ackermann, Berenbrink, Fischer, Hoefer. Concurrent Imitation Dynamics in Congestion Games. PODC 2009 / Distrib. Comput. 2016.
• Briest, Hoefer, Krysta. Stackelberg Network Pricing Games. STACS 2008 / Algorithmica 2012.
• Brandes, Delling, Gaertler, Görke, Hoefer, Nikoloski, Wagner. On Modularity Clustering. WG 2007 / IEEE TKDE 2008.
• Cardinal, Hoefer. Non-cooperative Facility Location and Covering Games. ISAAC 2006, WINE 2006 / TCS 2010.