Research Article

Hierarchical Combinatorial Auction in Computing Resource Allocation for Mobile Blockchain

Algorithm 2: A dynamic programming algorithm for solving the winning determination problem.

1. Collect bids () from each user , and initial the condition .
2. Calculate the optimal value function for each state.
3. Output: using to get the optimal allocation in each state.
Algorithm 2: A dynamic programming algorithm for solving the winning determination problem.