revealedPrefs

Revealed Preferences and Microeconomic Rationality

v0.4.1 · Sep 4, 2019 · 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

199

Last 30 days

16764th

199

Last 90 days

199

Last year

CRAN Check Status

14 NOTE

Show all 14 flavors

Flavor	Status	Time
r-devel-linux-x86_64-debian-clang	NOTE	107.9s
r-devel-linux-x86_64-debian-gcc	NOTE	71.8s
r-devel-linux-x86_64-fedora-clang	NOTE	151.6s
r-devel-linux-x86_64-fedora-gcc	NOTE	190.3s
r-devel-macos-arm64	NOTE	16s
r-devel-windows-x86_64	NOTE	163s
r-oldrel-macos-arm64	NOTE
r-oldrel-macos-x86_64	NOTE	45s
r-oldrel-windows-x86_64	NOTE	172s
r-patched-linux-x86_64	NOTE	95.2s
r-release-linux-x86_64	NOTE	87.3s
r-release-macos-arm64	NOTE
r-release-macos-x86_64	NOTE	53s
r-release-windows-x86_64	NOTE	145s

Check details (16 non-OK)

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-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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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-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-debian-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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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-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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost 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.}
       |               ^

Check History

NOTE 0 OK · 14 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE Mar 9, 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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost braces
    41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floy

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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost braces
    41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floy

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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost braces
    41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floy

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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost braces
    41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floy

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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost braces
    41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floy

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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost braces
    41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floy

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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost braces
    41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floy

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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost braces
    41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floy

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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost braces
    41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floy

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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost braces
    41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floy

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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost braces
    41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floy

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 the Floyd-Warshall algorithm. Much faster than \code{"floyd"}.}
       |                   ^
checkRd: (-1) cpUpper.Rd:41: Lost braces
    41 | \code{"floyd"}{ uses the algorithm described in Crawford and Pendakur (2013): at each step the complete Floy

Dependency Network

Version History

new 0.4.1 Mar 9, 2026