scholarly journals A rational delegating computation protocol based on reputation and smart contract

Author(s):  
Juan Ma ◽  
Yuling Chen ◽  
Ziping Wang ◽  
Guoxu Liu ◽  
Hongliang Zhu

AbstractThe delegating computation has become an irreversible trend, together comes the pressing need for fairness and efficiency issues. To solve this problem, we leverage game theory to propose a smart contract-based solution. First, according to the behavioral preferences of the participants, we design an incentive contract to describe the motivation of the participants. Next, to satisfy the fairness of the rational delegating computation, we propose a rational delegating computation protocol based on reputation and smart contract. More specifically, rational participants are to gain the maximum utility and reach the Nash equilibrium in the protocol. Besides, we design a reputation mechanism with a reputation certificate, which measures the reputation from multiple dimensions. The reputation is used to assure the client’s trust in the computing party to improve the efficiency of the protocol. Then, we conduct a comprehensive experiment to evaluate the proposed protocol. The simulation and analysis results show that the proposed protocol solves the complex traditional verification problem. We also conduct a feasibility study that involves implementing the contracts in Solidity and running them on the official Ethereum network. Meanwhile, we prove the fairness and correctness of the protocol.

2021 ◽  
Author(s):  
Michael Richter ◽  
Ariel Rubinstein

Abstract Each member of a group chooses a position and has preferences regarding his chosen position. The group’s harmony depends on the profile of chosen positions meeting a specific condition. We analyse a solution concept (Richter and Rubinstein, 2020) based on a permissible set of individual positions, which plays a role analogous to that of prices in competitive equilibrium. Given the permissible set, members choose their most preferred position. The set is tightened if the chosen positions are inharmonious and relaxed if the restrictions are unnecessary. This new equilibrium concept yields more attractive outcomes than does Nash equilibrium in the corresponding game.


Games ◽  
2021 ◽  
Vol 12 (1) ◽  
pp. 7
Author(s):  
Vassili N. Kolokoltsov

Quantum games and mean-field games (MFG) represent two important new branches of game theory. In a recent paper the author developed quantum MFGs merging these two branches. These quantum MFGs were based on the theory of continuous quantum observations and filtering of diffusive type. In the present paper we develop the analogous quantum MFG theory based on continuous quantum observations and filtering of counting type. However, proving existence and uniqueness of the solutions for resulting limiting forward-backward system based on jump-type processes on manifolds seems to be more complicated than for diffusions. In this paper we only prove that if a solution exists, then it gives an ϵ-Nash equilibrium for the corresponding N-player quantum game. The existence of solutions is suggested as an interesting open problem.


2021 ◽  
Author(s):  
S M Nazmuz Sakib

As may be seen, cryptography and game theory are the 2 primary parts of the phrase. game theory thinks about with optimizing a result involving 2 or a lot of well-defined parties, every with well-defined behavior. Nash equilibrium could be a notion in game theory that emphasizes the participants' mutual profit. , the unpredictability of the operational state of affairs, don't seem to be laid out in game theory. The goal of cryptography is to produce safe message transmission between genuine and approved parties. Multiparty computing could be a cryptographical technique that enables 2 or a lot of participants to calculate a perform conjointly. this can be kind of like the concept of reciprocal profit in game theory. throughout the employment of the protocol, all parties have a precise set of behavior determined, kind of like game theory. The parties, as an example, a probabilistic polynomials in nature. Cryptography doesn't specify however AN assailant could use it to breach the system just like the operation condition. In cryptography, multiparty interaction is outlined as parties communication to judge a perform on their inputs.


Author(s):  
Herbert Gintis

This chapter uses epistemic game theory to expand on the notion of social norms as choreographer of a correlated equilibrium, and to elucidate the socio-psychological prerequisites for the notion that social norms implement correlated equilibria. The correlated equilibrium is a much more natural equilibrium criterion than the Nash equilibrium, because of a famous theorem of Aumann (1987), who showed that Bayesian rational agents in an epistemic game G with a common subjective prior play a correlated equilibrium of G. Thus, while rationality and common priors do not imply Nash equilibrium, these assumptions do imply correlated equilibrium and social norms act not only as choreographer, but also supply the epistemic conditions for common priors.


2016 ◽  
Vol 28 (5) ◽  
pp. 471-477
Author(s):  
Shumin Feng ◽  
Xianghao Shen ◽  
Baoyu Hu

As the two most important modes in public transportation, the coordinated development of bus and metro networks significantly influences the efficiency of public transportation. However, two parallel bus and metro lines belonging to different operators may lead to supply competition and consequently yield over-supply. Taking two parallel bus and metro lines in Harbin city, China as a case study, this paper, drawing on game theory, establishes a utility model based on the two lines’ frequencies, and reveals and explains the fundamental reason for the over-supply problem using a Nash equilibrium. In an attempt to resolve this issue, the study proposes a new operation mode: integrating frequencies of the two modes to obtain larger total profits then reallocating the total profits to the two modes. The case study shows that this new operation mode can effectively solve the over-supply problem while satisfying both operators of the two modes, and hence having practical value.


2013 ◽  
Vol 347-350 ◽  
pp. 3971-3974 ◽  
Author(s):  
Heng Xiao ◽  
Cao Fang Long

With the development of network application, network security is facing greater pressure. Based on the characteristics of intrusion detection in the wireless network of the Ad hoc working group, the article introduces the game theory, proposes a game model of network security, concluds the Nash equilibrium in the stage game, repeats game, the pareto Nash equilibrium, more attack both income and payment, so that they get the best choice.


Sign in / Sign up

Export Citation Format

Share Document