auc_mean = []
N_ = []
print("\n ", y, "\n")
for x in range(1, 11):
N = 10 * x
b = 4
K = N * b
case_ = Main(K,
N,
15000,
log=True,
display_mat=False,
calc_m=calc_m_2,
calc_gain=calc_gain_squared)
case_.main()
res = case_.calc_avg_bps()
hun_min.append(res["hungarian"]["min"])
hun_mean.append(res["hungarian"]["mean"])
auc_min.append(res["auction"]["min"])
auc_mean.append(res["auction"]["mean"])
N_.append(N)
if (len(hun_min_avg) == 0):
hun_min_avg = hun_min
hun_mean_avg = hun_mean
auc_min_avg = auc_min
auc_mean_avg = auc_mean
else:
for i in range(0, len(hun_min)):
hun_min_avg[i] = (hun_min_avg[i] + hun_min[i]) / 2
hun_mean_avg[i] = (hun_mean_avg[i] + hun_mean[i]) / 2
# and constants
# such as K, b, M, N, epsilon, etc.
"""
# start of test case 1
# as described in the paper page 10, top right corner
K = 6
N = 3
b = int(K/N)
M = 2
eps = 1/(K+1)
edges = [(0, 4), (0, 1),
(1, 1), (1, 4),
(2, 2), (2, 0),
(3, 0), (3, 2),
(4, 5), (4, 3),
(5, 3), (5, 5)]
# end of test case 1
"""
# start of test case 2 using rayleigh fading
print("Input parameters K and N.")
print("Please note the K should be perfectly divisible by N")
print("To satisfy the relation K=bN\n")
K = int(input("K: "))
N = int(input("N: "))
main_ = Main(K, N, log=True, display_mat=True)
main_.main()
print(main_.calc_avg_bps())
