**Authors: **Fabrice Talla Nobibon Bart Smeulders Frits C R Spieksma

**Publish Date**: 2014/10/15

**Volume:** 166, **Issue:** 3, **Pages:** 1063-1070

## Abstract

This Note presents an algorithm for testing the generalized axiom of revealed preference that runs in quadratic time We show that this algorithm can be used to solve a more general problem on graphs Furthermore we prove a lower bound on the running time of any algorithm for testing different axioms of revealed preference

**Keywords:**