An algebraic approach to revealed preference
提出并发展了一种无需拓扑假设的代数方法，用代数公理取代经典揭示偏好公理，数据可理性化当且仅当满足该代数公理。
Abstract We propose and develop an algebraic approach to revealed preference. Our approach dispenses with non-algebraic structure, such as topological assumptions. We provide algebraic axioms of revealed preference that subsume previous classical revealed preference axioms and show that a data set is rationalizable if and only if it is consistent with an algebraic axiom.