revealedPrefs
Revealed Preferences and Microeconomic Rationality
v0.4.2
·
Mar 18, 2026
·
GPL (>= 3)
Description
Computation of (direct and indirect) revealed preferences, fast non-parametric tests of rationality axioms (WARP, SARP, GARP), simulation of axiom-consistent data, and detection of axiom-consistent subpopulations. Rationality tests follow Varian (1982) <doi:10.2307/1912771>, axiom-consistent subpopulations follow Crawford and Pendakur (2012) <doi:10.1111/j.1468-0297.2012.02545.x>.
Downloads
663
Last 30 days
5677th
1K
Last 90 days
2.6K
Last year
Trend: +212.7% (30d vs prior 30d)
CRAN Check Status
14
OK
Show all 14 flavors
| Flavor | Status |
|---|---|
| r-devel-linux-x86_64-debian-clang | OK |
| r-devel-linux-x86_64-debian-gcc | OK |
| r-devel-linux-x86_64-fedora-clang | OK |
| r-devel-linux-x86_64-fedora-gcc | OK |
| r-devel-macos-arm64 | OK |
| r-devel-windows-x86_64 | OK |
| r-oldrel-macos-arm64 | OK |
| r-oldrel-macos-x86_64 | OK |
| r-oldrel-windows-x86_64 | OK |
| r-patched-linux-x86_64 | OK |
| r-release-linux-x86_64 | OK |
| r-release-macos-arm64 | OK |
| r-release-macos-x86_64 | OK |
| r-release-windows-x86_64 | OK |
Check History
OK 14 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE Mar 26, 2026
NOTE 0 OK · 14 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE Mar 10, 2026
NOTE
r-devel-linux-x86_64-debian-clang
CRAN incoming feasibility
Maintainer: ‘Julien Boelaert <jubo.stats@gmail.com>’
No Authors@R field in DESCRIPTION.
Please add one, modifying
Authors@R: person(given = "Julien",
family = "Boelaert",
role = c("aut", "cre"),
email = "jubo.stats@gmail.com")
as necessary.
NOTE
r-devel-linux-x86_64-debian-gcc
CRAN incoming feasibility
Maintainer: ‘Julien Boelaert <jubo.stats@gmail.com>’
No Authors@R field in DESCRIPTION.
Please add one, modifying
Authors@R: person(given = "Julien",
family = "Boelaert",
role = c("aut", "cre"),
email = "jubo.stats@gmail.com")
as necessary.
NOTE
r-devel-linux-x86_64-fedora-clang
Rd files
checkRd: (-1) cpUpper.Rd:39: Lost braces
39 | \code{"fastfloyd"}{ (default) uses an iterative variant of the Floyd-Warshall algorithm, in which the check of consistency of the current observation with a given cluster is done in a single step of t
...[truncated]...
st braces
41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floyd-Warshall algorithm is run to check whether each cluster can accomodate the current observation.}
| ^
NOTE
r-devel-linux-x86_64-fedora-gcc
Rd files
checkRd: (-1) cpUpper.Rd:39: Lost braces
39 | \code{"fastfloyd"}{ (default) uses an iterative variant of the Floyd-Warshall algorithm, in which the check of consistency of the current observation with a given cluster is done in a single step of t
...[truncated]...
st braces
41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floyd-Warshall algorithm is run to check whether each cluster can accomodate the current observation.}
| ^
NOTE
r-devel-macos-arm64
Rd files
checkRd: (-1) cpUpper.Rd:39: Lost braces
39 | \code{"fastfloyd"}{ (default) uses an iterative variant of the Floyd-Warshall algorithm, in which the check of consistency of the current observation with a given cluster is done in a single step of t
...[truncated]...
st braces
41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floyd-Warshall algorithm is run to check whether each cluster can accomodate the current observation.}
| ^
NOTE
r-devel-windows-x86_64
Rd files
checkRd: (-1) cpUpper.Rd:39: Lost braces
39 | \code{"fastfloyd"}{ (default) uses an iterative variant of the Floyd-Warshall algorithm, in which the check of consistency of the current observation with a given cluster is done in a single step of t
...[truncated]...
st braces
41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floyd-Warshall algorithm is run to check whether each cluster can accomodate the current observation.}
| ^
NOTE
r-patched-linux-x86_64
Rd files
checkRd: (-1) cpUpper.Rd:39: Lost braces
39 | \code{"fastfloyd"}{ (default) uses an iterative variant of the Floyd-Warshall algorithm, in which the check of consistency of the current observation with a given cluster is done in a single step of t
...[truncated]...
st braces
41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floyd-Warshall algorithm is run to check whether each cluster can accomodate the current observation.}
| ^
NOTE
r-release-linux-x86_64
Rd files
checkRd: (-1) cpUpper.Rd:39: Lost braces
39 | \code{"fastfloyd"}{ (default) uses an iterative variant of the Floyd-Warshall algorithm, in which the check of consistency of the current observation with a given cluster is done in a single step of t
...[truncated]...
st braces
41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floyd-Warshall algorithm is run to check whether each cluster can accomodate the current observation.}
| ^
NOTE
r-release-macos-arm64
Rd files
checkRd: (-1) cpUpper.Rd:39: Lost braces
39 | \code{"fastfloyd"}{ (default) uses an iterative variant of the Floyd-Warshall algorithm, in which the check of consistency of the current observation with a given cluster is done in a single step of t
...[truncated]...
st braces
41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floyd-Warshall algorithm is run to check whether each cluster can accomodate the current observation.}
| ^
NOTE
r-release-macos-x86_64
Rd files
checkRd: (-1) cpUpper.Rd:39: Lost braces
39 | \code{"fastfloyd"}{ (default) uses an iterative variant of the Floyd-Warshall algorithm, in which the check of consistency of the current observation with a given cluster is done in a single step of t
...[truncated]...
st braces
41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floyd-Warshall algorithm is run to check whether each cluster can accomodate the current observation.}
| ^
NOTE
r-release-windows-x86_64
Rd files
checkRd: (-1) cpUpper.Rd:39: Lost braces
39 | \code{"fastfloyd"}{ (default) uses an iterative variant of the Floyd-Warshall algorithm, in which the check of consistency of the current observation with a given cluster is done in a single step of t
...[truncated]...
st braces
41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floyd-Warshall algorithm is run to check whether each cluster can accomodate the current observation.}
| ^
NOTE
r-oldrel-macos-arm64
Rd files
checkRd: (-1) cpUpper.Rd:39: Lost braces
39 | \code{"fastfloyd"}{ (default) uses an iterative variant of the Floyd-Warshall algorithm, in which the check of consistency of the current observation with a given cluster is done in a single step of t
...[truncated]...
st braces
41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floyd-Warshall algorithm is run to check whether each cluster can accomodate the current observation.}
| ^
NOTE
r-oldrel-macos-x86_64
Rd files
checkRd: (-1) cpUpper.Rd:39: Lost braces
39 | \code{"fastfloyd"}{ (default) uses an iterative variant of the Floyd-Warshall algorithm, in which the check of consistency of the current observation with a given cluster is done in a single step of t
...[truncated]...
st braces
41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floyd-Warshall algorithm is run to check whether each cluster can accomodate the current observation.}
| ^
NOTE
r-oldrel-windows-x86_64
Rd files
checkRd: (-1) cpUpper.Rd:39: Lost braces
39 | \code{"fastfloyd"}{ (default) uses an iterative variant of the Floyd-Warshall algorithm, in which the check of consistency of the current observation with a given cluster is done in a single step of t
...[truncated]...
st braces
41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floyd-Warshall algorithm is run to check whether each cluster can accomodate the current observation.}
| ^