【Author】
Asheralieva, Alia; Niyato, Dusit
【Source】IEEE TRANSACTIONS ON MOBILE COMPUTING
【Abstract】We consider a public blockchain realized in the mobile edge computing (MEC) network, where the blockchain miners compete against each other to solve the proof-of-work puzzle and win a mining reward. Due to limited computing capabilities of their mobile terminals, miners offload computations to the MEC servers. The MEC servers are maintained by the service provider (SP) that sells its computing resources to the miners. The SP aims at maximizing its long-term profit subject to miners' budget constraints. The miners decide on their hash rates, i.e., computing powers, simultaneously and independently, to maximize their payoffs without revealing their decisions to other miners. As such, the interactions between the SP and miners are modeled as a stochastic Stackelberg game under private information, where the SP assigns the price per unit hash rate, and miners select their actions, i.e., hash rate decisions, without observing actions of other miners. We develop a hierarchical learning framework for this game based on fully- and partially-observable Markov decision models of the decision processes of the SP and miners. We show that the proposed learning algorithms converge to stable states in which miners' actions are the best responses to the optimal price assigned by the SP.
【Keywords】Blockchain; Servers; Computational modeling; Games; Stochastic processes; Mobile computing; Edge computing; Blockchain; deep learning; game theory; incomplete information; Markov decision process; mining; mobile edge computing; partially-observable Markov decision process; reinforcement learning; re
评论