Alexander Braun

I am a PhD student in Theoretical Computer Science at University of Bonn, supervised by Prof. Dr. Thomas Kesselheim. In my research, I consider online resource allocation problems. That is, agents or consumers arrive sequentially and an allocation algorithm needs to immediately and irrevocably assign resources, without knowing the future arrivals. My main focus is on Prophet Inequalities in which some stochastic prior believe about the agents is available to the algorithm upfront.

In fall 2022, I was visiting the Simons Institute for the Theory of Computing at UC Berkeley for the program on Data-Driven Decision Processes. Before starting my PhD in 2019, I received a M.Sc. in Mathematics from University of Bonn.

Contact Details

University of Bonn
Institute of Computer Science, Dept. V
Room 2.066
Friedrich-Hirzebruch-Allee 8
(former: Endenicher Allee 19A)
D-53115 Bonn

Phone: (+49) 228 - 73 60683
Mail: firstname.lastname@uni-bonn.de

Office Hours: By appointment. Also virtual meetings are possible.

Research Interests

  • Resource Allocation Problems
  • Online Algorithms
  • Prophet Inequalities

Publications

  • Simplified Prophet Inequalities for Combinatorial Auctions
    A.B. and Thomas Kesselheim
    SIAM Symposium on Simplicity in Algorithms, SOSA 2023, Florence, Italy
    PDF | BibTex | ArXiv
  • Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities
    A.B. and Thomas Kesselheim
    ACM Conference on Economics and Computation, EC 2021, Budapest, Hungary (virtual)
    PDF | BibTex | ArXiv | Talk
    (Journal Version accepted for publication in Mathematics of Operations Research)
  • Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions
    A.B., Matthias Buttkus and Thomas Kesselheim
    29th Annual European Symposium on Algorithms, ESA 2021, Lisbon, Portugal (virtual)
    PDF | BibTex | ArXiv | Talk

Teaching Assistance


Page Tools