sfaR (Q55765): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed label, description and/or aliases in en, and other parts
Swh import (talk | contribs)
SWHID from Software Heritage
 
(2 intermediate revisions by 2 users not shown)
Property / source code repository
 
Property / source code repository: https://github.com/cran/sfaR / rank
 
Normal rank
Property / Software Heritage ID
 
Property / Software Heritage ID: swh:1:snp:1bf8a3f21b99f702508170bdd01cd1d2e5846aec / rank
 
Normal rank
Property / Software Heritage ID: swh:1:snp:1bf8a3f21b99f702508170bdd01cd1d2e5846aec / qualifier
 
Property / Software Heritage ID: swh:1:snp:1bf8a3f21b99f702508170bdd01cd1d2e5846aec / qualifier
 
point in time: 15 October 2023
Timestamp+2023-10-15T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:52, 22 March 2024

Stochastic Frontier Analysis Routines
Language Label Description Also known as
English
sfaR
Stochastic Frontier Analysis Routines

    Statements

    0 references
    0.1.1
    5 May 2022
    0 references
    0.0.91
    5 March 2021
    0 references
    0.1.0
    4 May 2021
    0 references
    1.0.0
    4 July 2023
    0 references
    0 references
    4 July 2023
    0 references
    Maximum likelihood estimation for stochastic frontier analysis (SFA) of production (profit) and cost functions. The package includes the basic stochastic frontier for cross-sectional or pooled data with several distributions for the one-sided error term (i.e., Rayleigh, gamma, Weibull, lognormal, uniform, generalized exponential and truncated skewed Laplace), the latent class stochastic frontier model (LCM) as described in Dakpo et al. (2021) <doi:10.1111/1477-9552.12422>, for cross-sectional and pooled data, and the sample selection model as described in Greene (2010) <doi:10.1007/s11123-009-0159-1>, and applied in Dakpo et al. (2021) <doi:10.1111/agec.12683>. Several possibilities in terms of optimization algorithms are proposed.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers