Implementation of various inference and simulation tools to
    apply generalized additive models to bivariate dependence structures and
    non-simplified vine copulas.

Implements the GAMbag, GAMrsm and GAMens ensemble
    classifiers for binary classification (De Bock et al., 2010) <doi:10.1016/j.csda.2009.12.013>. The ensembles
    implement Bagging (Breiman, 1996) <doi:10.1023/A:1010933404324>, the Random Subspace Method (Ho, 1998) <doi:10.1109/34.709601>
    , or both, and use Hastie and Tibshirani's (1990, ISBN:978-0412343902) generalized additive models (GAMs)
    as base classifiers. Once an ensemble classifier has been trained, it can
    be used for predictions on new data. A function for cross validation is also
    included.

Finds adaptive strategies for sequential symmetric 
    games using a genetic algorithm. Currently, any symmetric two by two matrix
    is allowed, and strategies can remember the history of an opponent's play
    from the previous three rounds of moves in iterated interactions between
    players. The genetic algorithm returns a list of adaptive strategies given
    payoffs, and the mean fitness of strategies in each generation.

Implementation of a common set of punctual solutions  for Cooperative Game Theory.

Many situations can be modeled as game theoretic situations. Some procedures are included in this package to calculate the most important allocations rules in Game Theory: Shapley value, Owen value or nucleolus, among other. First, we must define as an argument the value of the unions of the envolved agents with the characteristic function.

The gamma lasso algorithm provides regularization paths corresponding to a range of non-convex cost functions between L0 and L1 norms.  As much as possible, usage for this package is analogous to that for the glmnet package (which does the same thing for penalization between L1 and L2 norms).  For details see: Taddy (2017 JCGS), 'One-Step Estimator Paths for Concave Regularization', <arXiv:1308.5623>.