Abstract
Yildiz (2016a) proposes a novel tool, namely choice regularities, to classify choice theories according to the syntactic structure of the underlying choice axioms. We focus on the regularity of the SARP-like acyclicity requirements. Axiomatic characterizations of many choice theories contain conditions formulated in the vein of the strong axiom of revealed preference (SARP), such as Masatlioglu et al. (2012)and Yildiz (2016b), in which a binary relation –based on the observed choice behavior– is formulated and its acyclicity is required. We focus on the regularity of the SARP-like acyclicity requirements. For those binary relations that can be represented in a specific form, we find an upper bound on the degree of the free regularities that impose the binary relation to be acyclic.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Pamukkale University Journal of Social Sciences Institute
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
