Answers are grounded in this paper and cite their sources.
This paper seeks to identify which algorithm to employ in a situation where goods are distributed to individuals without using money, while treating everyone equally and respecting each individual's preferences. I compare two stochastic assignment mechanisms: Random serial dictatorship (RSD) and top trading cycles with random endowments (TTC). In standard theory, both algorithms are strategy-proof and yield the optimal result. In the experiment, RSD outperforms TTC. This can be attributed to a more dominant strategy play under RSD. Generally, subjects with extremely high and low levels of contingent reasoning play their dominant strategies. These results suggest that one optimal algorithm may outperform another one if individuals are boundedly rational.
No takes yet. Share an insight, caveat, or question.
André Schmelzer (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: