The Crawler: Three Equivalence Results for Object (Re)allocation Problems when Preferences Are Single-peaked

TL;DR

This paper explores the properties of the 'crawler' rule in object reallocation with single-peaked preferences, establishing its equivalence with its dual, invariance to preference order, and connection to the random priority rule.

Contribution

It proves three key equivalence results for the crawler rule, enhancing understanding of its behavior under single-peaked preferences and its relation to other allocation rules.

Findings

The crawler and its dual are the same rule.

The crawler is invariant to the choice of preference order.

The probabilistic crawler equals the random priority rule.

Abstract

For object reallocation problems, if preferences are strict but otherwise unrestricted, the Top Trading Cycles rule (TTC) is the leading rule: It is the only rule satisfying efficiency, individual rationality, and strategy-proofness. However, on the subdomain of single-peaked preferences, Bade (2019) defines a new rule, the "crawler", which also satisfies these three properties. (i) The crawler selects an allocation by "visiting" agents in a specific order. A natural "dual" rule can be defined by proceeding in the reverse order. Our first theorem states that the crawler and its dual are actually the same. (ii) Single-peakedness of a preference profile may in fact hold for more than one order and its reverse. Our second theorem states that the crawler is invariant to the choice of the order. (iii) For object allocation problems (as opposed to reallocation problems), we define a probabilistic version of the crawler by choosing an endowment profile at random according to a uniform distribution, and applying the original definition. Our third theorem states that this rule is the same as the "random priority rule".