Prof. Dr. Daniel Schmand
Leader of WG Discrete OptimizationMy email ends with @uni-bremen.de.
Memberships
- Member of the high-profile area Minds, Media, Machines
- Member of the high-profile area Logistics
Research Areas
- Algorithmic Game Theory
- Discrete Optimization
- Efficient Algorithms
- Robust Optimization
Projects
- hyBit: Hydrogen for Bremen's industrial transformation (01.09.2022 - 28.02.2026)
Courses (Selection)
- Online Optimization (Wintersemester 2025/2026)
- Algorithmic Game Theory (Wintersemester 2025/2026)
- Algorithmic Game Theory (Sommersemester 2025)
- Mathematik 1b für Wirtschaftsingenieure (Sommersemester 2024)
- Mathematik 1a für Wirtschaftsingenieure (Wintersemester 2023/2024)
Theses (Selection)
- Offensichtliche Manipulierbarkeit von gewichteten Voting Rules - Entwicklung eines Verfahrens für die k-approval rule (Hanna Günther)
- Einfluss unterschiedlicher Zielfunktionen in bilateralen Netzwerkverbindungsspielen (Ole Conradi)
- Algorithmische Lösung eines Clusteringproblems zur Bildung von Fahrgemeinschaften (Julian Gebken)
- Nash-Gleichgewichte in Netzwerkverbindungsspielen mit Prioritäten (Stefan Molidor)
- Prophet Inequalities Over Time (Florian Jonas)
Publications (Selection)
- M. de la Haye, P. Lenzner, D. Schmand, N. Schröder.
Network Creation Games with 2-Neighborhood Maximization.
14th International Conference on Algorithms and Complexity (CIAC 2025).
- D. Schmand, T. Schürenberg, M. Strehler.
On the Price of Anarchy in Packet Routing Games with FIFO.
14th International Conference on Algorithms and Complexity (CIAC 2025).
- A. Abels, E. Pitschmann, D. Schmand.
Prophet-Inequalities over Time.
ACM Transactions on Economics and Computation, 13(4):18:1-18:36, 2025.
(previously at EC 2023)DOI: 10.1145/3766547
- N. Bertschinger, M. Hoefer, D. Schmand.
Flow Allocation Games.
Mathematics of Operations Research, 50(1):68-89, 2025.
(previously at ITCS 2020) - M. Grobler, S. Maaz, N. Megow, A. E. Mouawad, V. Ramamoorthi, D. Schmand, S. Siebertz.
Solution Discovery via Reconfiguration for Problems in P.
51st International Colloquium on Automata, Languages, and Programming (ICALP 2024).


