Related papers: Payment Networks as Creation Games
A network model of manufacturing system is considered. This is a network formation game where players are participants of a production process and their actions are their's requests for interaction. Production networks are formed as a…
The aim of this article is to propose a core game theory model of transaction costs wherein it is indicated how direct costs determine the probability of loss and subsequent transaction costs. The existence of optimum is proven, and the way…
We consider a network pricing game on a parallel network with congestion effects in which link owners set tolls for travel so as to maximize profit. A central authority is able to regulate this competition by means of a (uniform) price cap.…
Public blockchains inherently offer low throughput and high latency, motivating off-chain scalability solutions such as Payment Channel Networks (PCNs). However, existing PCNs suffer from liquidity fragmentation-funds locked in one channel…
Network creation games model the creation and usage costs of networks formed by a set of selfish peers. Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links. In doing so, a peer can…
While being decentralized, secure, and reliable, Bitcoin and many other blockchain-based cryptocurrencies suffer from scalability issues. One of the promising proposals to address this problem is off-chain payment channels. Since, not all…
To improve transaction rates, many cryptocurrencies have implemented so-called ''Layer-2'' transaction protocols, where payments are routed across networks of private payment channels. However, for a given transaction, not every network…
Dynamic networks are graphs in which edges are available only at specific time instants, modeling connections that change over time. The dynamic network creation game studies this setting as a strategic interaction where each vertex…
Synthesis of finite-state controllers from high-level specifications in multi-agent systems can be reduced to solving multi-player concurrent games over finite graphs. The complexity of solving such games with qualitative objectives for…
Network congestion games are a convenient model for reasoning about routing problems in a network: agents have to move from a source to a target vertex while avoiding congestion, measured as a cost depending on the number of players using…
Internet and graphs are very much related. The graphical structure of internet has been studied extensively to provide efficient solutions to routing and other problems. But most of these studies assume a central authority which controls…
The present dissertation addresses the problem of fairly distributing shared resources in non-commercial blockchain networks. Blockchains are distributed systems that order and timestamp records of a given network of users, in a public,…
A distributed Nash equilibrium seeking algorithm is presented for networked games. We assume an incomplete information available to each player about the other players' actions. The players communicate over a strongly connected digraph to…
Offchain networks provide a promising solution to overcome the scalability challenges of cryptocurrencies. However, design tradeoffs of offchain networks are still not well-understood today. In particular, offchain networks typically rely…
Blockchain has received increasing attention in academia and industry. However, the increasing transaction volumes and limited on-chain storage underscore scalability as a key challenge hindering the widespread adoption of blockchain.…
This paper studies the existence of pure Nash equilibria in resource graph games, which are a general class of strategic games used to succinctly represent the players' private costs. There is a finite set of resources and the strategy set…
We consider the problem of designing distribution rules to share "welfare" (cost or revenue) among individually strategic agents. There are many known distribution rules that guarantee the existence of a (pure) Nash equilibrium in this…
As an alternative view to the graph formation models in the statistical physics community, we introduce graph formation models using \textit{network formation} through selfish competition as an approach to modeling graphs with particular…
While the original purpose of blockchains was to realize a payment system, it has been shown that, in fact, such systems do not require consensus and can be implemented deterministically in asynchronous networks. State-of-the-art payment…
In this paper we study a model of weighted network formation. The bilateral interaction is modeled as a Tullock contest game with the possibility of a draw. We describe stable networks under different concepts of stability. We show that a…