Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Mean Field Game Analysis of Consensus Protocol Design
259
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A decentralized blockchain is a distributed ledger that is often used as a platform for exchanging goods and services. This ledger is maintained by a network of nodes that obeys a set of rules, called a consensus protocol, which helps to resolve inconsistencies among local copies of a blockchain. In this paper, we build a mathematical framework for the consensus protocol designer that specifies (a) the measurement of a resource which nodes strategically invest in and compete for in order to win the right to build new blocks in the blockchain; and (b) a payoff function for their efforts. Thus the equilibrium of an associated stochastic differential game can be implemented by selecting nodes in proportion to this specified resource and penalizing dishonest nodes by its loss. This associated, induced game can be further analyzed by using mean field games. The problem can be broken down into two coupled PDEs, where an individual nodes optimal control path is solved using a Hamilton-Jacobi-Bellman equation, where the evolution of states distribution is characterized by a Fokker-Planck equation. We develop numerical methods to compute the mean field equilibrium for both steady states at the infinite time horizon and evolutionary dynamics. As an example, we show how the mean field equilibrium can be applied to the Bitcoin blockchain mechanism design. We demonstrate that a blockchain can be viewed as a mechanism that operates in a decentralized setup and propagates properties of the mean field equilibrium over time, such as the underlying security of the blockchain.
rate research
Read More
We consider a mean field game (MFG) of optimal portfolio liquidation under asymmetric information. We prove that the solution to the MFG can be characterized in terms of a FBSDE with possibly singular terminal condition on the backward component or, equivalently, in terms of a FBSDE with finite terminal value, yet singular driver. Extending the method of continuation to linear-quadratic FBSDE with singular driver we prove that the MFG has a unique solution. Our existence and uniqueness result allows to prove that the MFG with possibly singular terminal condition can be approximated by a sequence of MFGs with finite terminal values.
This paper is devoted to the singular perturbation problem for mean field game systems with control on the acceleration. This correspond to a model in which the acceleration cost vanishes. So, we are interested in analyzing the behavior of solutions to the mean field game systems arising from such a problem as the acceleration cost goes to zero. In this case the Hamiltonian fails to be strictly convex and superlinear w.r.t. the momentum variable and this creates new issues in the analysis of the problem. We obtain that the limit problem is the classical mean field game system.
This paper presents scalable traffic stability analysis for both pure autonomous vehicle (AV) traffic and mixed traffic based on continuum traffic flow models. Human vehicles are modeled by a non-equilibrium traffic flow model, i.e., Aw-Rascle-Zhang (ARZ), which is unstable. AVs are modeled by the mean field game which assumes AVs are rational agents with anticipation capacities. It is shown from linear stability analysis and numerical experiments that AVs help stabilize the traffic. Further, we quantify the impact of AVs penetration rate and controller design on the traffic stability. The results may provide insights for AV manufacturers and city planners.
The Paxos distributed consensus algorithm is a challenging case-study for standard, vector-based model checking techniques. Due to asynchronous communication, exhaustive analysis may generate very large state spaces already for small model instances. In this paper, we show the advantages of graph transformation as an alternative modelling technique. We model Paxos in a rich declarative transformation language, featuring (among other things) nested quantifiers, and we validate our model using the GROOVE model checker, a graph-based tool that exploits isomorphism as a natural way to prune the state space via symmetry reductions. We compare the results with those obtained by the standard model checker Spin on the basis of a vector-based encoding of the algorithm.
This paper establishes unique solvability of a class of Graphon Mean Field Game equations. The special case of a constant graphon yields the result for the Mean Field Game equations.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
