Table 2 Information and computation of protocol based on review strategies

The design stage

1.

Each consumer reports d _n and B(·) to designer.

2.

Designer computes a ^PO and a ^NE.

3.

Designer determines the protocol ϕ(L,K,G).

4.

Designer informs each consumer about a ^PO,a ^NE,p(a ^PO), and Ψ(L,K,G).

The operation stage (each billing cycle m):

1.

Each consumer performs its load schedule \({a^{t}_{n}}\), ∀t=m L+1,…,(m+1)L.

2.

Designer determines \(\hat {p}^{t}, \forall t = mL + 1,\ldots, (m+1)L\) based on the actual load schedule.

3.

Each consumer is charged according to its load d _n and the price \(\hat {p}^{t}, \forall t = mL + 1, \ldots, (m+1)L\) at the end of the current cycle.

4.

The statistical test G is performed using \(\hat {p}^{t}\), ∀t=m L+1,…,(m+1)L to determine which phase (review or punishment) the next billing cycle is in.