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

CRAN

526

Last 30 days

6866th

1.6K

Last 90 days

3.8K

Last year

Trend: +1.4% (30d vs prior 30d)

r2u CRAN

Last 30 days

139

Last 90 days

435

Last year

Trend: -25.9% (30d vs prior 30d)

autoCRAN

Last 7 days

Last 30 days

All-time

autoCRAN-only: this name is served only by autoCRAN, so the count is exact.

CRAN Check Status

13 OK

Show all 13 flavors

Flavor	Status	Time
r-devel-linux-x86_64-debian-clang	OK	105.5s
r-devel-linux-x86_64-debian-gcc	OK	75.3s
r-devel-linux-x86_64-fedora-clang	OK	156.9s
r-devel-linux-x86_64-fedora-gcc	OK	188.2s
r-devel-windows-x86_64	OK	164s
r-oldrel-macos-arm64	OK	15s
r-oldrel-macos-x86_64	OK	83s
r-oldrel-windows-x86_64	OK	177s
r-patched-linux-x86_64	OK	94.7s
r-release-linux-x86_64	OK
r-release-macos-arm64	OK	16s
r-release-macos-x86_64	OK	56s
r-release-windows-x86_64	OK	162s

Check History

OK 13 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE Jun 8, 2026

NOTE 12 OK · 1 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE Jun 7, 2026

NOTE r-devel-linux-x86_64-debian-gcc

R code for possible problems

Warning in file(open = "w+") :
  cannot open file '/tmp/RtmpmzYYNq/Rf75605506aaa1': No space left on device
Error in file(open = "w+") : cannot open the connection
Calls: <Anonymous> -> .load_namespace_quietly -> .try_quietly -> file
Execution halted

OK 14 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE Apr 22, 2026

ERROR 13 OK · 0 NOTE · 0 WARNING · 1 ERROR · 0 FAILURE Apr 18, 2026

ERROR r-devel-windows-x86_64

whether package can be installed

Installation failed.
See 'd:/Rcompile/CRANpkg/local/4.6/revealedPrefs.Rcheck/00install.out' for details.

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.}
       |               ^

Dependency Network

Version History

6 tracked

updated 0.4.2 ← 0.4.1 diff Mar 18, 2026

new 0.4.1 Mar 10, 2026

updated 0.4.1 ← 0.4 diff Sep 4, 2019

updated 0.4 ← 0.2 diff Oct 9, 2018

updated 0.2 ← 0.1 diff Nov 28, 2014

new 0.1 Jun 23, 2014