Dr. Timo Mennle
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.
Mechanism Design; Market Design; Matching; Assignment; Prediction Markets; Financial Markets; Electronic Commerce.
Partial Strategyproofness: An Axiomatic Approach to Relaxing Strategyproofness for Assignment Mechanisms.
Timo Mennle and Sven Seuken. October 2015 (first version: January 2014). [pdf]
Extended Abstract: An Axiomatic Approach to Characterizing and Relaxing Strategyproofness of One-sided Matching Mechanisms in Proceedings of the 15th ACM Conference on Economics and Computation (EC), Palo Alto, USA, June 2014.
Trade-offs in School Choice: Comparing Deferred Acceptance, the Naive and the Adaptive Boston Mechanism.
Timo Mennle and Sven Seuken. October 2015 (first version: February 2014).[pdf]
Hybrid Mechanisms: Trading Off Strategyproofness and Efficiency of Random Assignment Mechanisms.
Timo Mennle and Sven Seuken. Working paper. October 2015 (first version: February 2013).[pdf]
The Pareto Frontier for Random Mechanisms.
Timo Mennle and Sven Seuken. October 2015 (first version: February 2015).[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]
On the Difficulty of Comparing School Choice Mechanisms by Their Vulnerability to Manipulation.
Umut Dur, Timo Mennle, and Sven Seuken. Preliminary overview of results, February 2016.[pdf]
An Axiomatic Characterization of Strategyproof Ordinal Mechanisms with Indifferences.
Timo Mennle and Sven Seuken. Research Note. July 2014.[pdf]
Relaxing Strategyproofness in One-sided Matching.
Timo Mennle and Sven Seuken. ACM SIGecom Exchanges, Vol. 13, No. 1, June 2014.[pdf]
- 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
Advised Theses (with Sven Seuken)
- Computing Pareto Frontiers for Randomized Mechanisms.
Bachelor Thesis by Daniel Abächerli. 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.
- Analysing Prediction Markets.
Independent Study by Leonardo Stedile. 2013.