MultiAgentDecisionProcess
|
#include <iostream>
#include "Globals.h"
#include "BGIP_IncrementalSolverInterface_T.h"
#include "BGIP_BnB_Node.h"
#include "BnB_JointTypeOrdering.h"
#include <float.h>
#include <queue>
#include <algorithm>
#include <limits.h>
#include "JPPVValuePair.h"
#include "PartialJPDPValuePair.h"
#include "VectorTools.h"
Classes | |
class | BGIP_SolverBranchAndBound< JP > |
BGIP_SolverBranchAndBound is a class that performs Branch-and-Bound search for identical payoff Bayesian Games. More... | |
Macros | |
#define | BAILOUT_WHEN_CBG_LOWERBOUND_IS_HIT 0 |
#define | CACHE_IMPLIED_JPOL 0 |
#define | CHECK_VALID_JA 0 |
#define | DEBUG_VALID_ACTIONS 0 |
#define | INITIALIZE_LB_TO_BESTFOUND 1 |
#define | PRINTNUM 100000 |
#define BAILOUT_WHEN_CBG_LOWERBOUND_IS_HIT 0 |
#define CACHE_IMPLIED_JPOL 0 |
#define CHECK_VALID_JA 0 |
#define DEBUG_VALID_ACTIONS 0 |
#define INITIALIZE_LB_TO_BESTFOUND 1 |
#define PRINTNUM 100000 |
Referenced by BGIP_SolverBranchAndBound< JP >::PrintStatistics().