Committee Selection Based on Game Theory in Sharding Blockchain
We explore the problem of how much computational power would miners contribute to different kinds of committees in the view of game theory. We model the game as a two-stage hierarchical game. In the first stage, miners compete for the seat of the directory service (DS) committee and then in the second stage, those who are not DS committees members play games for rest shards formation. We prove the existence of the Nash equilibrium and obtain it in the simulation.