Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2110.09765

Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems

Jinmian Chen·Yukun Cheng·Zhiqi Xu·Yan Cao
View original source ↗Read source document ↗Export metadata ↓

Abstract

In a PoW-based blockchain network, mining pools (the solo miner could be regarded as a mining pool containing one miner) compete to successfully mine blocks to pursue rewards. Generally, the rewards include the fixed block subsidies and time-varying transaction fees. The transaction fees are offered by the senders whose transactions are packaged into blocks and is increasing with the block size. However, the larger size of a block brings the longer latency, resulting in a smaller probability of successfully mining. Therefore, finding the optimal block size to trade off these two factors is a complex and crucial problem for the mining pools. In this paper, we model a repeated mining competition dynamics in blockchain system as an evolutionary game to study the interactions among mining pools. In this game, each pool has two strategies: to follow the default size $\bar{B}$, i.e., the upper bound of a block size, or not follow. Because of the bounded rationality, each mining pool pursues its evolutionary stable block size (ESS) according to the mining pools' computing power and other factors by continuous learning and adjustments during the whole mining process. A study framework is built for the general evolutionary game, based on which we then theoretically explore the existence and stability of the ESSs for a case of two mining pools. Numerical experiments with real Bitcoin data are conducted to show the evolutionary decisions of mining pools and to demonstrate the theoretical findings in this paper.

Explore related subjects

cs.GT

Keep this discovery

BibTeXRIS

Jinmian Chen, Yukun Cheng, Zhiqi Xu, Yan Cao. 2021-10-19. Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems. https://arxiv.org/abs/2110.09765

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT↗
arXiv2026

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT↗
arXiv2026

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT↗