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). [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]