Dr. Timo Mennle

Dr. Timo Mennle
Postdoc
Department of Informatics
University of Zurich
Binzmühlestrasse 14
CH-8050 Zürich
Room BIN 2.B.03
Tel +41 44 635 43 32
Email mennle@ifi.uzh.ch

Short Bio

Since March 2016, Timo is a Postdoc with the Computation and Economics Research Group at the Department of Informatics of the University of Zurich. He holds a Ph.D. in Computer Science from the University of Zurich and a M.Sc. (Diplom) in Mathematics with a minor in Computer Science from the University of Freiburg, Germany. From January 2010 till December 2011, Timo worked as a management consultant for the Business Technology Office of McKinsey & Company.

Research Interests

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

Working Papers and Work in Progress

  • Partial Strategyproofness: Relaxing Strategyproofness for the Random Assignment Problem.
    Timo Mennle and Sven Seuken. January 2017 (first version: January 2014). [pdf]
    Online Appendix. [pdf]
  • First Choice-Maximizing School Choice Mechanisms.
    Umut Dur, Timo Mennle, and Sven Seuken. November 2016. [pdf]
  • The Pareto Frontier for Random Mechanisms.
    Timo Mennle and Sven Seuken. January 2017 (first version: February 2015). [pdf]
  • Hybrid Mechanisms: Trading Off Strategyproofness and Efficiency of Random Assignment Mechanisms.
    Timo Mennle and Sven Seuken. January 2017 (first version: February 2013).[pdf]
  • Trade-offs in School Choice: Comparing Deferred Acceptance, the Naive and the Adaptive Boston Mechanism.
    Timo Mennle and Sven Seuken. January 2017 (first version: February 2014). [pdf]

Publications (Peer-Reviewed)

  • 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.
    Working Paper: [pdf]
  • 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.
    Working Paper: [pdf]
  • 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. [pdf]

Other Work

  • Local Sufficiency for Partial Strategyproofness.
    Timo Mennle and Sven Seuken. Research Note. January 2017 (first version: October 2015).[pdf]
  • Two New Impossibility Results for the Random Assignment Problem.
    Timo Mennle and Sven Seuken. Research Note. January 2017 (first version: July 2016).[pdf]
  • An Axiomatic Characterization of Strategyproof Ordinal Mechanisms with Indifferences.
    Timo Mennle and Sven Seuken. Research Note. January 2017 (first version: July 2014).[pdf]
  • 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]

Teaching

Advised Theses

  • 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.