Dr. Timo Mennle

Timo is a Postdoc in the research group of Prof. Dr. Sven Seuken.

As of October 2017, Timo is working as a Product Manager for the Sensor Manufacturer SICK AG in Reute, Germany.

Timo joined the Computation and Economics Research Group as a PhD student in February 2012. In February 2016, he completed his dissertation on the Design of Markets Without Money (PDF, 3 MB) with Prof. Dr. Sven Seuken (mark: summa cum laude). Subsequently, he continued his research as a Postdoc (until May 2017) and as a Research Associate/Oberassistent (until September 2017). Before joining our group, Timo worked as a management consultant with the Business Technology Office of McKinsey & Company between January 2010 and December 2011. He holds a M.Sc. (Diplom) in Mathematics with a minor in Computer Science (mark: 1) from the University of Freiburg, Germany.

Mechanism Design; Market Design; Matching; Assignment; Prediction Markets; Financial Markets; Electronic Commerce.

• Partial Strategyproofness: Relaxing Strategyproofness for the Random Assignment Problem.
  Timo Mennle and Sven Seuken. July 2020 (first version: January 2014). [arxiv]
• The Pareto Frontier for Random Mechanisms.
  Timo Mennle and Sven Seuken. January 2017 (first version: February 2015). [arxiv]
• Hybrid Mechanisms: Trading Off Strategyproofness and Efficiency of Random Assignment Mechanisms.
  Timo Mennle and Sven Seuken. July 2017 (first version: February 2013).[arxiv]
• Trade-offs in School Choice: Comparing Deferred Acceptance, the Classic and the Adaptive Boston Mechanism.
  Timo Mennle and Sven Seuken. July 2017 (first version: February 2014). [arxiv]

• First-Choice Maximal and First-Choice Stable School Choice Mechanisms.
  Umut Dur, Timo Mennle, and Sven Seuken. In Proceedings of the 19th ACM Conference on Economics and Computation (EC), Ithaca, NY, June 2018. [acm.org] [pdf including appendix on SSRN] [Talk at EC'18]
• The Pareto Frontier for Random Mechanisms.
  Extended Abstract in Proceedings of the 17th ACM Conference on Economics and Computation (EC), Maastricht, The Netherlands, July 2016. [acm.org] [current working paper on arxiv]
• An Axiomatic Approach to Characterizing and Relaxing Strategyproofness of One-sided Matching Mechanisms. 
  Extended Abstract in Proceedings of the 15th ACM Conference on Economics and Computation (EC), Palo Alto, USA, June 2014. [acm.org] [current working paper on arxiv]
• The Power of Local Manipulation Strategies in Assignment Mechanisms.
  Timo Mennle, Michael Weiss, Basil Philipp, and Sven Seuken. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), Buenos Aires, Argentina, August 2015. [acm.org] [pdf] 

• Local Sufficiency for Partial Strategyproofness.
  Timo Mennle and Sven Seuken. Research Note. July 2020 (first version: October 2015).[arxiv]
• Two New Impossibility Results for the Random Assignment Problem.
  Timo Mennle and Sven Seuken. Research Note. July 2020 (first version: July 2016).[arxiv]
• An Axiomatic Characterization of Strategyproof Ordinal Mechanisms with Indifferences.
  Timo Mennle and Sven Seuken. Research Note. July 2020 (first version: July 2014).[arxiv]
• Tradeoffs between Strategyproofness and Efficiency of Ordinal Mechanisms.
  Timo Mennle. PhD Thesis. Feburary 2016. [pdf]
• Relaxing Strategyproofness in One-sided Matching.
  Timo Mennle and Sven Seuken. ACM SIGecom Exchanges, Vol. 13, No. 1, June 2014.[pdf]

• Fall 2016: Lecturer for Lecture Economics and Computation
• Fall 2014: Teaching Assistant for Lecture Economics and Computation
• Fall 2013: Teaching Assistant for Seminar Advanced Topics in Economics and Computation
• Spring 2013: Teaching Assistant for Lecture Economics and Computation
• Fall 2012: Teaching Assistant for Seminar Advanced Topics in Economics and Computation
• Spring 2012: Teaching Assistant for Lecture Economics and Computation

• Computing Pareto Frontiers for Randomized Mechanisms.
  Bachelor Thesis by Daniel Abächerli. 2015.
  Winner of the Semesterpreis Fall 2015.
• Leveraging Competition Amongst Peers as a Motivating Factor in Learning Software.
  Bachelor Thesis by Stefan Bublitz. 2014.
• Matching Experiments on Amazon Mechanical Turk.
  Bachelor Thesis by Michael Weiss. 2014.
• Simulation of Boundedly Rational Manipulation Strategies in One-Sided Matching Markets.
  Bachelor Thesis by Basil Philipp. 2013.
  Winner of the Semesterpreis Spring 2013.
• Analysing Prediction Markets.
  Independent Study by Leonardo Stedile. 2013.