| 1. |
- Altman, Eitan, et al.
(författare)
-
Blockchain Competition Between Miners: A Game Theoretic Perspective
- 2020
-
Ingår i: Frontiers in Blockchain. - : Frontiers Media SA. - 2624-7852. ; 2
-
Tidskriftsartikel (refereegranskat)abstract
- We model the competition over mining resources and over several cryptocurrencies as a non-cooperative game. Leveraging results about congestion games, we establish conditions for the existence of pure Nash equilibria and provide efficient algorithms for finding such equilibria. We account for multiple system models, varying according to the way that mining resources are allocated and shared and according to the granularity at which mining puzzle complexity is adjusted. When constraints on resources are included, the resulting game is a constrained resource allocation game for which we characterize a normalized Nash equilibrium. Under the proposed models, we provide structural properties of the corresponding types of equilibrium, e.g., establishing conditions under which at most two mining infrastructures will be active or under which no miners will have incentives to mine a given cryptocurrency.
|
|
| 2. |
- Altman, Eitan, et al.
(författare)
-
Mining Competition in a Multi-Cryptocurrency Ecosystem at the Network Edge: A Congestion Game Approach
- 2019
-
Ingår i: Performance Evaluation Review. - : Association for Computing Machinery (ACM). - 0163-5999. ; 46:3, s. 114-117
-
Tidskriftsartikel (refereegranskat)abstract
- We model the competition over several blockchains characterizing multiple cryptocurrencies as a non-cooperative game. Then, we specialize our results to two instances of the general game, showing properties of the Nash equilibrium. In particular, leveraging results about congestion games, we establish the existence of pure Nash equilibria and provide efficient algorithms for finding such equilibria.
|
|
| 3. |
- Sena, Paulo, et al.
(författare)
-
Caching Policies over Unreliable Channels
- 2020
-
Ingår i: 2020 18th international symposium on modeling and optimization in mobile, ad hoc, and wireless networks (wiopt). - : IEEE.
-
Konferensbidrag (refereegranskat)abstract
- Recently, there has been substantial progress in the formal understanding of how caching resources should be allocated when multiple caches each deploy the common LRU policy. Nonetheless, the role played by caching policies beyond LRU in a networked setting where content may be replicated across multiple caches and where channels are unreliable is still poorly understood. In this paper, we investigate this issue by first analyzing the cache miss rate in a system with two caches of unit size each, for the LRU, and the LFU caching policies, and their combination. Our analytical results show that joint use of the two policies outperforms LRU, while LFU outperforms all these policies whenever resource pooling is not optimal. We provide empirical results with larger caches to show that simple alternative policies, such as LFU, provide superior performance compared to LRU even if the space allocation is not fine tuned. We envision that fine tuning the cache space used by such policies may lead to promising additional gains.
|
|
