The El Farol Bar Problem for next generation systems

those staying at home to attend the bar.*/
const float m1=8;
const float m3=1.01;
//** Critical Values **
/* up and down are the boundaries and d is used in the shuffle
variation */
const float up=0.9;
const float down=0.1;
const int d=2;
//** Budget Algorithms **
const int wait=10; //maximum waiting time
/*** ***Main program *** ***/
int main()
{
int i,k; //for
int *a_agent; //array of attendances
float *p_agent //array of M propabilities for nt iterations
int *god; //a_agent for all iterations
int *a_total; //attendance after each iteration
int *sgn; //array in partial sign algorithm
float *tax_agent; //array in tax algorithm
float *mu; //array full of \mu’s
int *u_total; //array of total payoffs after each iteration
int ans1,ans2; //Answers in interface
int j,sum,l; //used in budget algorithms
int max,max_out; //maximum attendances in budget
const gsl_rng_type *T; //random generator
gsl_rng *r; //random generator
/* create a generator chosen by the environment variable
GSL_RNG_TYPE */
gsl_rng_env_setup();
T = gsl_rng_default;
r = gsl_rng_alloc (T);
printf("How many agents should be viewed in probabilities plot?\n");
scanf("%d",&ans2);
/* Initializing variables i=0 and Initial Conditions IC */
p_agent = (float *)malloc((M*nt)*sizeof(float));
god = (int *)malloc((M*nt)*sizeof(int));
a_total = (int *)malloc((nt)*sizeof(int));
a_agent = (int *)malloc((M)*sizeof(int));
sgn = (int *)malloc((nt)*sizeof(int));
tax_agent = (float *)malloc((M)*sizeof(float));
mu = (float *)malloc((M)*sizeof(float));
u_total = (int *)malloc((M*nt)*sizeof(int));
for(i=0; i