Skip to content

C++ code of the simulation presented in Artificial Intelligence and Auction Design (M. Banchio, A. Skrzypacz, 2022)

Notifications You must be signed in to change notification settings

yannKerzreho/AuctionSimulationQL

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

26 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

AuctionSimulationQL

This repository contains a C++ implementation of a simulation framework for auction scenarios using Q-learning. The simulation is designed to model interactions between two agents engaged in auctions over multiple iterations as presented in Artificial Intelligence and Auction Design by M. Banchio and A. Skrzypacz 2022.

Main Contents

  • simulation: The main simulation function (simulation) that models the auction process, taking various parameters like alpha, beta, gamma and epsilon (for the parametrization of QL algorithm). opt is used to initialize Q-matrix, num_iterations set the number of round play by the algorithm, possible_bet are the available actions (with a price set at 1), and pricer manage the auction design (1 for a first price and 2 for a second price, between 1 and 2 for any convex combinaison). It return an array with all the greedy action for each round.

  • findConvergence: The function (findConvergence) analyzes the convergence of Q-algo over combinaison of a specified parameters (used to run (simulation)). num_it_param set how many run is done for each combinaison of parameter and numConv set the number of iteration used to assume convergence. It return an array with each simulation in row and in colum: the convergence of the first algo, the convergence of the second, and the set of parameters used for the simulation (alpha, beta, gamma, epsilon, opt, num_iterations, pricer).

Additional function

  • findCol: To extract from a array a colum the function (findCol) take as argument a std::vector<std::vector<double>>and a int for the index of the colum.

  • writeCSV: Creat a .csv at the path (first argument) with the set of vectors used as argument.

Example

// Example parameters
std::vector<double> alpha = {0.05, 0.1};
std::vector<double> beta = {0.001};
std::vector<double> gamma = {0.99, 0.95};
std::vector<double> epsilon = {0.25};
std::vector<double> opt = {10};
std::vector<int> num_iterations = {100000};
std::vector<double> pricer = {1};
int num_it_param = 10;
int numConv = 10000;

// Run simulations
std::vector<std::vector<double>> conv = simulConvergence(alpha, beta, gamma, epsilon, opt, num_iterations, possible_bet, pricer, num_it_param, numConv);

// Extract and write results
std::vector<double> conv1 = findCol(conv, 0);
std::vector<double> conv2 = findCol(conv, 1);
std::vector<double> alphas = findCol(conv, 2);
std::vector<double> gammas = findCol(conv, 4);

writeCSV("/Users/yannkerzreho/Documents/AC/sim_convergence.csv", conv1, conv2, alphas, gammas);

About

C++ code of the simulation presented in Artificial Intelligence and Auction Design (M. Banchio, A. Skrzypacz, 2022)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages