Two Simple Algorithms for Generating a Subset of Data Consistent With WARP and Other Binary Relations
给出两种算法，将数据划分为与显示偏好弱公理一致及其补集的两个子集，主要贡献是一个快速但不精确的算法，另有一个精确但大数据集不实用的算法。
Abstract We give two algorithms that partition data into two subsets, a set consistent with the weak axiom of revealed preference (WARP) and its complement. Our main contribution is a very fast, but inexact, algorithm. We also describe an exact algorithm that will be impractical for large data sets. These same algorithms may be applied to several other binary relationships such as the nonparametric production axioms. Because violations of WARP are also violations of the strong (SARP) and generalized (GARP) axioms, these algorithms are a logical first step in computing subsets consistent with these relations. KEY WORDS: Generalized axiom of revealed preferenceRevealed cost minimizationRevealed preferenceRevealed profit maximizationVertex cover problemWeak axiom of revealed preference