Despite the truthful dominant strategy, participants in strategy-proof mechanisms submit manipulated preferences. In our model, participants dislike rejections and enjoy the confirmation from getting what they declared most desirable. Formally, the payoff from a match decreases in its position in the submitted ranking such that a strategic trade-off between preference intensity and match probability arises. This trade-o↵ can trigger the commonly observed self-selection strategies. We show that misrepresentations can persist for arbitrarily small report-dependent components. However, honesty is guaranteed to be optimal if and only if there is no conflict between the quality and feasibility of a matc
We consider manipulation of collective decision making rules in a framework where voters not only ra...
Recent experimental studies find excessive truth-telling in sender-receiver games. We show that this...
This paper investigates the robustness of Dutta and Sen's (2012) Theorem 1 to re-ductions in the str...
Despite the truthful dominant strategy, participants in strategy-proof mechanisms submit manipulated...
Since no stable matching mechanism can induce truth-telling as a dominant strategy for all participa...
Mechanisms which implement stable matchings are often observed to work well in practice, even in env...
We test the effect of the amount of information on the strategies played by others in the theoretica...
Two informed and interested parties (senders) repeatedly send messages to an uninformed party (publi...
Proper scoring rules are scoring methods that incentivize honest reporting of subjective probabiliti...
Strategy-proofness, requiring that truth-telling is a dominant strategy, is a standard concept used ...
We investigate implementation of social choice functions that map from states to lotteries and may d...
Motivated by growing evidence of agents' mistakes in strategically simple environments, we propose a...
We consider full implementation in abstract complete-information environments when agents have an ar...
Strategy-proofness, requiring that truth-telling is a dominant strategy, is a standard concept used ...
The definitive version is available at www3.interscience.wiley.comWe study dominant strategy mechani...
We consider manipulation of collective decision making rules in a framework where voters not only ra...
Recent experimental studies find excessive truth-telling in sender-receiver games. We show that this...
This paper investigates the robustness of Dutta and Sen's (2012) Theorem 1 to re-ductions in the str...
Despite the truthful dominant strategy, participants in strategy-proof mechanisms submit manipulated...
Since no stable matching mechanism can induce truth-telling as a dominant strategy for all participa...
Mechanisms which implement stable matchings are often observed to work well in practice, even in env...
We test the effect of the amount of information on the strategies played by others in the theoretica...
Two informed and interested parties (senders) repeatedly send messages to an uninformed party (publi...
Proper scoring rules are scoring methods that incentivize honest reporting of subjective probabiliti...
Strategy-proofness, requiring that truth-telling is a dominant strategy, is a standard concept used ...
We investigate implementation of social choice functions that map from states to lotteries and may d...
Motivated by growing evidence of agents' mistakes in strategically simple environments, we propose a...
We consider full implementation in abstract complete-information environments when agents have an ar...
Strategy-proofness, requiring that truth-telling is a dominant strategy, is a standard concept used ...
The definitive version is available at www3.interscience.wiley.comWe study dominant strategy mechani...
We consider manipulation of collective decision making rules in a framework where voters not only ra...
Recent experimental studies find excessive truth-telling in sender-receiver games. We show that this...
This paper investigates the robustness of Dutta and Sen's (2012) Theorem 1 to re-ductions in the str...