Skip to main content

Advances, Systems and Applications

Table 2 Results of running the example using our algorithm

From: A resource competition-based truthful mechanism for IoV edge computing resource allocation with a lowest revenue limit

Round

\(\lambda \varepsilon\)

Unit price

Users state Active:1 Inactive:0

Allocation solution

Payment

result

1

(0.61,0.5)

(0.61,0.5)

(1,1,1)

\(x_{21},x_{32}\)

3.44,4.44

\(<B\)

2

(0.61,0.5)

(1.22,1.0)

(0,1,1)

\(x_{21},x_{32}\)

6.88,8.88

\(<B\)

3

(0.5,0.5)

(1.72,1.5)

(0,1,1)

\(x_{21},x_{32}\)

9.89,12.89

\(<B\)

4

(0.5,0.5)

(2.22,2.0)

(0,1,1)

\(x_{21},x_{32}\)

12.89,16.89

\(29.78>B\)