Related Experiment Video
Updated: Jul 30, 2025

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm
Published on: October 20, 2022
Coalition Formation Game for Cost-Efficient Multiparty Payment Channel in Payment Channel Networks
1Computer Engineering Department, Gachon University, Seongnam-si 13120, Republic of Korea.
Abstract:
Blockchain has introduced a new era for online payment services and its economy with tamper-proof cryptocurrencies. However, blockchain, which is based on global peer-to-peer networks, has its limitations due to payment delays from global consensus and transaction costs for maintenance. Thus, payment channel networks (PCN) have been proposed as one of the most promising off-chain solutions, allowing users to pay directly through payment channels (PC), with minimal blockchain involvement. However, payment delays and cost problems still exist, especially given the large size of the PCN. This study proposes a multiparty payment channel (MPC) that enables multiple users to join the same PC and exchange payment transactions, compared to the legacy PC. To avoid a consensus procedure among users in the PC, we introduce sequential and parallel updates for the PC status. Since increasing the MPC size limits the advantages in terms of the delay and cost, we propose a distributed coalition formation algorithm to form the MPC group, in which each user has the choice to join or leave the group. Simulations show that the proposed algorithm establishes MPCs successfully, considering the trade-off between the payoff gain and the MPC delay cost.
Related Concept Videos
Uniform Depth Channel Flow: Problem Solving
Uniform Depth Channel Flow
Radical Chain-Growth Polymerization: Overview
Radical Chain-Growth Polymerization: Chain Branching
Anionic Chain-Growth Polymerization: Overview
Alternative Sets of Equilibrium Equations
One example of such a situation can be observed in a...

