Timo Mennle

According to our database, Timo Mennle authored at least 12 papers between 2013 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

Partial strategyproofness: Relaxing strategyproofness for the random assignment problem.

Timo Mennle, Sven Seuken

J. Econ. Theory, 2021

2020

An Axiomatic Decomposition of Strategyproofness for Ordinal Mechanism with Indifferences.

Timo Mennle, Sven Seuken

CoRR, 2020

Two New Impossibility Results for the Random Assignment Problem.

Timo Mennle, Sven Seuken

CoRR, 2020

Local Sufficiency for Partial Strategyproofness.

Timo Mennle, Sven Seuken

CoRR, 2020

2018

First-Choice Maximal and First-Choice Stable School Choice Mechanisms.

Umut Mert Dur, Timo Mennle, Sven Seuken

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2016

The Pareto Frontier for Random Mechanisms.

Timo Mennle, Sven Seuken

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015

The Efficient Frontier in Randomized Social Choice.

Timo Mennle, Sven Seuken

CoRR, 2015

The Power of Local Manipulation Strategies in Assignment Mechanisms.

Timo Mennle, Michael Weiss, Basil Philipp, Sven Seuken

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

Relaxing strategyproofness in one-sided matching.

Timo Mennle, Sven Seuken

SIGecom Exch., 2014

The Naive versus the Adaptive Boston Mechanism.

Timo Mennle, Sven Seuken

CoRR, 2014

An axiomatic approach to characterizing and relaxing strategyproofness of one-sided matching mechanisms.

Timo Mennle, Sven Seuken

Proceedings of the ACM Conference on Economics and Computation, 2014

2013

Partially Strategyproof Mechanisms for the Assignment Problem

Timo Mennle, Sven Seuken

CoRR, 2013