-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathTradeAction.cxx
153 lines (97 loc) · 4.68 KB
/
TradeAction.cxx
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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
#include <TradeAction.hxx>
#include <World.hxx>
#include <Province.hxx>
#include <Logger.hxx>
namespace Epnet
{
TradeAction::TradeAction()
{
}
TradeAction::~TradeAction()
{
std::cout<<"tradeDone?"<<std::endl;
}
void TradeAction::execute(Engine::Agent& agent)
{
Roman & offerer = (Roman&)agent;
Engine::World * world = agent.getWorld();
Province & provinceWorld = (Province&) *world;
std::vector<std::string> gto= provinceWorld.getTypesOfGood();
std::random_shuffle(gto.begin(),gto.end());//random the order of good like that we don't go to buy the same product first
std::vector<std::string>::iterator it = gto.begin();
std::string offererProducedGood= std::get<0>(offerer.getProducedGood());
//For all type of ressource
while(it != gto.end()){
std::string goodWanted = *it;
if(goodWanted != offererProducedGood){
std::vector< std::string > exchangeNetwork =offerer.getValidRcvConnections();
std::random_shuffle(exchangeNetwork.begin(),exchangeNetwork.end());
std::vector< std::string >::iterator itO=exchangeNetwork.begin();
std::tuple< std::string, double, double> bestTrade=std::make_tuple<std::string,double,double>(std::string(""),0,0);
//qt is the quantity that of is own produced good the agent is willing to exchange
double requestedQuantity= offerer.getPrice(goodWanted)/offerer.getPrice(offererProducedGood)-offerer.getQuantity(goodWanted);
double proposedQuantity = offerer.getPrice(offererProducedGood);
int noffer=0;
bool tradeDone = 0;
while(itO != exchangeNetwork.end() && !tradeDone && noffer<=100) //TODO:number of max test <nbmax (maybe gintis use it only because of computational limitiation)
{
noffer++;
Roman & responder = (Roman&)(*world->getAgent(*itO));
std::string responderProducedGood = std::get<0>(responder.getProducedGood());
if(responderProducedGood == goodWanted ){
double responderTradeWill = responder.getPrice(offererProducedGood)/responder.getPrice(goodWanted)-responder.getQuantity(offererProducedGood);
double responderTradCounter= (responder.getPrice(goodWanted));
if( responderTradeWill <= proposedQuantity &&
//( proposedQuantity*responder.getPrice(offererProducedGood) <= requestedQuantity*responder.getPrice(goodWanted)) &&
responder.getQuantity(goodWanted) >= requestedQuantity &&
offerer.getQuantity(offererProducedGood) >= proposedQuantity &&
responder.getQuantity(goodWanted) - requestedQuantity >= responder.getPrice(goodWanted) &&
responderTradCounter<=requestedQuantity)
{
if(responderTradeWill<=proposedQuantity)proposedQuantity=responderTradeWill;
if(std::get<2>(bestTrade) <= requestedQuantity){
bestTrade=std::make_tuple(*itO,requestedQuantity,proposedQuantity);
tradeDone=1;
}
}else{
//trade fail
}
}
itO++;
}
if(std::get<0>(bestTrade) != ""){
//The usage of a best trade tuple have sense only if users could exchange less than Requested quantity.
//This would imply that an offerer will check each person in the market and trade with each one of them and keep the best offerer
//But in the Gintis version people leave the market when they did a trade so not useful now.
offerer.setQuantity(goodWanted,std::get<1>(bestTrade));
offerer.setQuantity(offererProducedGood,offerer.getQuantity(offererProducedGood)-std::get<2>(bestTrade));
Roman & responder = (Roman&)(*world->getAgent(std::get<0>(bestTrade)));
responder.setQuantity(offererProducedGood,responder.getQuantity(offererProducedGood)+std::get<2>(bestTrade));
responder.setQuantity(goodWanted,responder.getQuantity(goodWanted)-std::get<1>(bestTrade));
}
else{
//the agent has leaved the market without doing any trade
}
}
it++;
}
}
double TradeAction::getRequestedQuantity(Engine::Agent & agent, std::string goodWanted){
Roman & r = (Roman&)agent;
std::string producedGood= std::get<0>(r.getProducedGood());
double Mo = r.getPrice(producedGood)*r.getQuantity(producedGood);
double SumOj=0;
// double Mo=0;
std::vector< std::tuple< std::string, double, double, double, double, double > > allGoods = r.getListGoods();
for(std::vector< std::tuple< std::string, double, double, double, double, double > >::iterator ot = allGoods.begin();ot != allGoods.end();ot ++){
std::string ressource= std::get<0>(*ot);
SumOj+=r.getPrice(ressource)*r.getNeed(ressource);
// Mo+=r.getPrice(ressource);
}
return ((r.getNeed(goodWanted)*Mo/SumOj)-r.getQuantity(goodWanted));
}
std::string TradeAction::describe() const
{
return "Trade action";
}
} // namespace Epnet