RGG/extendedTimedTest.cpp at master · albertjiang/RGG · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#include<iostream>
#include<vector>
#include<utility>
#include "proj_func.h"
#include "trie_map.h"
#include "rgg.h"
#include <chrono>
#include "ubcsat-time.h"
#include <tuple>

using std::get;
using std::vector;
using std::cout;
using std::endl;
using std::cin;

typedef std::chrono::high_resolution_clock Clock;


int main() {
  long long totalMakeRGGTime = 0;
  long long totalMakeNFGTime = 0;
  long long totalRGGBestResponseTime = 0;
  long long totalNFGBestResponseTime = 0;

  int numPlayers;
  cout << "Enter in the number of players playing this game: ";
  cin >> numPlayers;
  int numNodes;
  cout << "Enter in the number of resource nodes in this game: ";
  cin >> numNodes;
  cout << endl << "Testing Game with " << numPlayers << " Players and " << numNodes << " Resource Nodes: " << endl << endl;
  for(int i = 0; i<1000; i++) {
    auto t9 = Clock::now();
    vector<vector<vector<int>>> neweqMatrices(numPlayers);
    vector<vector<vector<int>>> newLtMatrices{};
    vector<vector<int>> neweqVectors(numPlayers);
    vector<vector<int>> newltVectors{};
    vector<vector<int>> neighbors = rgg::createSelfLoopGraph(numNodes);
    rgg* r = rgg::makeRandomRGG(numPlayers,numNodes, neweqMatrices, neweqVectors, newLtMatrices, newltVectors, neighbors);
    r->addDefaultLT();
    auto t10 = Clock::now();
    //int makeRGGTime = std::chrono::duration_cast<std::chrono::nanoseconds>(t10 - t9).count();
    totalMakeRGGTime += std::chrono::duration_cast<std::chrono::nanoseconds>(t10 - t9).count();
    //r->multiLinearSolve();
    //Normal Form Best Response
    auto t11 = Clock::now();
    int playerNumber = 0;
    Gambit::GameTableRep* nfg = r->toNormalForm();
    auto t12 = Clock::now();
    //auto makeNFGTime = std::chrono::duration_cast<std::chrono::nanoseconds>(t12 - t11).count();
    totalMakeNFGTime += std::chrono::duration_cast<std::chrono::nanoseconds>(t12 - t11).count();
    //r->multiLinearSolve();
    //r->printNormalFormGame(nfg);
    Gambit::StrategyProfileIterator iter{Gambit::StrategySupportProfile(nfg)};
    Gambit::PureStrategyProfile p = *iter;
    auto t1 = Clock::now();
    Gambit::List<Gambit::GameStrategy> bestResponseList = r->normalFormBestResponseList(playerNumber, p, nfg);
    auto t2 = Clock::now();
    totalNFGBestResponseTime += std::chrono::duration_cast<std::chrono::nanoseconds>(t2 - t1).count();
    /*for(int i = 1; i<=bestResponseList.size(); i++) {
      cout << endl;
      cout << "NFG Best Response Number " << i <<  endl;
      Gambit::GameStrategy gs = bestResponseList[i];
      for(auto c: r->convertNFGStrategyToRGGStrategy(playerNumber, gs)) {
        cout << c << " ";
      }
      cout << endl;
    }*/
    //RGG Best Response
    rgg::pureStrategyProfile rggPsp =  r->convertNFGPureStrategyProfileToRGGFormat(p);
    /*for(auto a:rggPsp) {
      for(auto b: a){
        cout << b << " ";
      }
      cout << endl;
    }*/
    //cout << endl;
    auto t3 = Clock::now();
    rgg::pureStrategy rggBR = r->rggBestResponse(playerNumber, rggPsp);
    auto t4 = Clock::now();
    //cout << endl;
    //auto rggBestResponseTime = std::chrono::duration_cast<std::chrono::nanoseconds>(t4 - t3).count();
    totalRGGBestResponseTime += std::chrono::duration_cast<std::chrono::nanoseconds>(t4 - t3).count();
    /*cout << "RGG Best Response" << endl;
    for(auto p : rggBR) {
      cout << p << " ";
    }
    cout << endl << endl;*/
  }
  std::cout << "Total Time Taken to create 1000 Resource Graph versions of Game: "
            << totalMakeRGGTime
            << " nanoseconds" << std::endl << endl;
  std::cout << "Time Taken to create 1000 Normal Form versions of Game: "
            << totalMakeNFGTime
            << " nanoseconds" << std::endl << endl;
  cout << "Creating RGG is " << (double)totalMakeNFGTime/(double)totalMakeRGGTime << " times faster than creating NFG." << endl << endl;
  std::cout << "Time Taken For 1000 NFG Best Responses: "
            << totalNFGBestResponseTime
            << " nanoseconds" << std::endl;
  std::cout << "Time Taken For 1000 RGG Best Responses: "
            << totalRGGBestResponseTime
            << " nanoseconds" << std::endl << endl;
  cout << "RGG Best Response Algorithm is " << (double)totalNFGBestResponseTime/(double)totalRGGBestResponseTime << " times as fast as NFG Best Response. " << endl << endl;
}