Two Simple Algorithms for Generating a Subset of Data Consistent with WARP and Other Binary Relations
The authors give two algorithms which partition data into two subsets, a set consistent with the weak axiom of revealed preference (WARP) and its complement. Their main contribution is a very fast, but inexact, algorithm. The authors also describe an exact algorithm which will be impractical for large data sets. These same algorithms may be applied to several other binary relationships such the nonparametric production axioms. Since violations of WARP are also violations of the strong and generalized axioms, these algorithms are a logical first step in computing subsets consistent with these relations.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 14 (1996)
Issue (Month): 2 (April)
|Contact details of provider:|| Web page: http://www.amstat.org/publications/jbes/index.cfm?fuseaction=main|
|Order Information:||Web: http://www.amstat.org/publications/index.html|
When requesting a correction, please mention this item's handle: RePEc:bes:jnlbes:v:14:y:1996:i:2:p:251-55. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.