Prediction of the Outcome Sample Clauses

Prediction of the Outcome. ‌ A client intends to predict round kx in which an agreement would be reached with the i,k GRA if the client’s greediness was βc from the current round onwards. To estimate i,k this round, a client assumes that the GRA’s reservation amount of resource Gmax and i,k the level of greediness βgra do not change in future rounds, because a client is not aware when resource availability may change and on which amount, nor how much those changes affect the GRA’s proposals as long as we have only estimates of the GRA’s negotiation parameters. Other reason to assume “no changes” in future is that a client focuses only on the sequential order of the predicted rounds for the different client tactics, but not their absolute values (this is explained in Section 3.3.3.3). Assume that tc = tgra and βgra is estimated as in Formula (3.15). If βgra is calculated dl dl i,k and a client assumes that the GRA applies the time-dependent strategy of Xxxxxxx i,k et al. [17], then Gmax − Gmin = (tc /k)βgra .rˆgra − GminΣ. In those cases when βgra i,k i dl i,k i cannot be estimated because of the changes in resource availability, we assume that β gra i,k gra i,k−1 . Following a discussion mentioned above, Equations (3.10), (3.11) for = β round kx can be presented as below. . Σβc c max x kx i,k . t min maxΣ rˆi,k = Ri + c i,k gra rˆi,k − Gi dl Ri − Ri , t gra min kx i,k tdl rˆi,k = Gi + c xx . Σβgra . c Σβgra . Σ x i,kx i,kx min . Considering rˆc = rˆgra , Equation (3.34) is derived from Formula (3.33). kx