Game::EPECAlgorithmParams Struct Reference

Stores the configuration for EPEC algorithms. More...

#include <games.h>

Data Fields
Game::EPECalgorithm	algorithm = Game::EPECalgorithm::fullEnumeration
Game::EPECRecoverStrategy	recoverStrategy
	Specifies the method by which innerApproximation should seek for a PNE. More...
Game::EPECAddPolyMethod	addPolyMethod = Game::EPECAddPolyMethod::sequential
bool	boundPrimals {false}
double	boundBigM {1e5}
	Bounding upper value if BoundPrimals is true. More...
long int	addPolyMethodSeed
bool	indicators {true}
	Uses bigM if false. More...
double	timeLimit
	Controls the timelimit for solve in Game::EPEC::findNashEq. More...
unsigned int	threads
	Controls the number of threads Gurobi exploits. Default 0 (auto) More...
unsigned int	aggressiveness
	in EPEC::iterativeNash More...
bool	pureNE {false}
	NE. If none exists, it will return a MNE (if exists) More...

Detailed Description

Stores the configuration for EPEC algorithms.

Definition at line 425 of file games.h.

Field Documentation

addPolyMethod

Game::EPECAddPolyMethod Game::EPECAlgorithmParams::addPolyMethod = Game::EPECAddPolyMethod::sequential

Definition at line 430 of file games.h.

addPolyMethodSeed

long int Game::EPECAlgorithmParams::addPolyMethodSeed

Initial value:

{
      -1}

Random seed for the random selection of polyhedra. If -1, a default computed value will be seeded.

Definition at line 434 of file games.h.

aggressiveness

unsigned int Game::EPECAlgorithmParams::aggressiveness

Initial value:

{
      1}

in EPEC::iterativeNash

Controls the number of random polyhedra added at each iteration

Definition at line 443 of file games.h.

algorithm

Game::EPECalgorithm Game::EPECAlgorithmParams::algorithm = Game::EPECalgorithm::fullEnumeration

Definition at line 426 of file games.h.

boundBigM

double Game::EPECAlgorithmParams::boundBigM {1e5}

Bounding upper value if BoundPrimals is true.

Definition at line 433 of file games.h.

boundPrimals

bool Game::EPECAlgorithmParams::boundPrimals {false}

If true, each QP param is bounded with an arbitrary large bigM constant

Definition at line 431 of file games.h.

indicators

bool Game::EPECAlgorithmParams::indicators {true}

Uses bigM if false.

Controls the flag useIndicators in Game::LCP.

Definition at line 437 of file games.h.

pureNE

bool Game::EPECAlgorithmParams::pureNE {false}

NE. If none exists, it will return a MNE (if exists)

If true, the algorithm will tend to search for pure

Definition at line 446 of file games.h.

recoverStrategy

Game::EPECRecoverStrategy Game::EPECAlgorithmParams::recoverStrategy

Initial value:

=
      EPECRecoverStrategy::incrementalEnumeration

Specifies the method by which innerApproximation should seek for a PNE.

Definition at line 427 of file games.h.

threads

unsigned int Game::EPECAlgorithmParams::threads

Initial value:

{
      0}

Controls the number of threads Gurobi exploits. Default 0 (auto)

Definition at line 441 of file games.h.

timeLimit

double Game::EPECAlgorithmParams::timeLimit

Initial value:

{
      -1}

Controls the timelimit for solve in Game::EPEC::findNashEq.

Definition at line 439 of file games.h.

---

The documentation for this struct was generated from the following file:

• games.h