Complete numerical solutions for "Inference of ecological and social drivers of human brain-size evolution" by Mauricio González-Forero and Andy Gardner

This zip file contains the complete numerical solutions across the parameter sweep over the P parameters for the six cases considered.

/1RatioForm/ -> solutions for power competence.
/2DiffForm/ -> solutions for exponential competence.

/1RatioForm/1BenchmarkFromSimpleInitialGuess -> solution for the step 1 of initialization (section 5 of the SI).
/1RatioForm/2Benchmark/ -> solution for the step 2 of the initialization (section 5 of the SI).
/1RatioForm/3AdditiveCoop/ -> solutions across the P parameter combinations for additive cooperation.
/1RatioForm/4MultCoop/ -> solutions across the P parameter combinations for multiplicative cooperation.
/1RatioForm/5SubMultCoop/ -> solutions across the P parameter combinations for submultiplicative cooperation.

The contents of /2DiffForm/ are analogous.

The P vector is written in these files in the order (etas,etac,etaC,etag), where
etas -> P1
etac -> P3
etaC -> P2
etag -> P4

The files 1runNotesACMC.pdf and 2runNotesSC.pdf contain the tree structure of the parameter sweep, specifying which parameter combination was used as the resident and which combinations converged to an uninvadable strategy (those with a checkmark).

The file 3runNotesMaternalCareOptimization.pdf contains the 10 parameter combinations that yielded the best adult fit, which then were subject to variation in the parameter phi to find the combination that yielded the best ontogenetic fit.

The file 4runNotesDuplicates.pdf gives the parameter combinations that were not run because they are equivalent to other parameter combinations.

Running [T,N1,run,Tshort,N1short,runShort]=etaCombinations in Matlab and typing run.seed{i}.parallel{:} gives the "next" parameter combinations from parameter combination i (where i is a number 1,2,...) for PC-AC, EC-MC, PC-SC, and EC-SC. The meaning of "next" is explained in step 4 of the parameter sweep (section 5 of the SI). Typing runShort.seed{i}.parallel{:} gives the "next" parameter combinations from parameter combination i for PC-MC and EC-AC.

The terminal folders contain the solutions and have the following files:
brainNashDeep.m -> the master file launching the iteration of best responses.
brainMainDeep.m -> the file launching one iteration solving the optimal control problem to find best response.
brainMainTestRunDeep.m -> runs a test to check if there are infeasibility warnings.
brainContinuous.m -> specifies the dynamic constraints.
brainEndpoint.m -> specifies the terminal constraints.
parameters.m -> specifies the parameter values and rescales them to rescale units as specified in section 5 of the SI.
getSolution.m -> extracts solution.
plots.m -> plots solutions over best response iterations.
brainPlot.m -> plots solution of a given best response iteration.
guessDeep.mat -> initial guess and resident used.
solutionNashDeep.mat -> solutions over best response iterations.
solutionDeep.mat -> solution of last best response iteration.