Testing substitutability

We provide an algorithm for testing the substitutability of a length-N preference relation over a set of contracts X in time O(|X|3⋅N3). Access to the preference relation is essential for this result: We show that a substitutability-testing algorithm with access only to an agentʼs choice function must make an expected number of queries exponential in |X|. An analogous result obtains when the agentʼs preferences are quasilinear in a numeraire and the algorithm only has access to the agentʼs underlying valuation function.