A revealed preference test of rationing a Monte Carlo analysis

This paper develops and evaluates a rationing linear programming procedure that uses an “efficiency index” to allow for violations of revealed preference to be attributed to “almost” optimal choices. The procedure detects rationing using U.K. data. Various Monte Carlo simulations are performed to evaluate the ability of the procedure to differentiate between violations of revealed preferences caused by random error and those caused by rationing.