A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Filters
Rational Agreement in the Presence of Crash Faults
[article]
2021
arXiv
pre-print
Blockchain systems need to solve consensus despite the presence of rational users and failures. ...
We show, on the other hand, that the existence of a (k,t)-robust consensus protocol in the crash model that does not make use of a baiting strategy implies the existence of a (k-t,t)-robust consensus protocol ...
We propose in Lemma 4.1 a first relation between Byzantine fault tolerance and crash-fault tolerance in the presence of rational players. Lemma 4.1. ...
arXiv:2111.01425v1
fatcat:qeiq4chqzbhnng6leycmmekpaq
SightSteeple: Agreeing to Disagree with Functional Blockchain Consensus
[article]
2022
arXiv
pre-print
We motivate two adversary models, one with a standard crash-fault adversary and another with a novel rational-fault adversary, to compromise functional blockchain consensus. ...
We then present two versions of a blockchain protocol called SightSteeple, that achieves functional blockchain consensus in the said fault models. ...
an asymmetric agreement on privileged information. ...
arXiv:2205.00672v1
fatcat:d2t467b5kzavvgxsxgrzxbi67y
The cost of probabilistic gathering in oblivious robot networks
[article]
2008
arXiv
pre-print
In this paper we address the complexity issues of two agreement problems in oblivious robot networks namely gathering and scattering. ...
The contribution of this paper is twofold. First, we propose a detailed complexity analysis of the existent probabilistic gathering algorithms in both fault-free and fault-prone environments. ...
First, we proposed a detailed complexity analysis of the existent probabilistic agreement algorithms (gathering and scattering) in both fault-free and fault-prone environments. ...
arXiv:0807.1753v1
fatcat:5lcivd5h5vdgbcel6cjt5opqd4
A Methodology to Efficiently Compare Operating System Stability
2015
2015 IEEE 16th International Symposium on High Assurance Systems Engineering
Despite decades of advances in software engineering, operating systems (OSes) are still plagued by crashes due to software faults, calling for techniques to improve OS stability when faults occur. ...
To guarantee unbiased and comparable results, finally, our methodology relies on the use of pre-and posttests to isolate the direct impact of faults from the stability of the OS itself. ...
ACKNOWLEDGMENT This research was supported in part by European Research Council grant 227874. ...
doi:10.1109/hase.2015.22
dblp:conf/hase/KouweGGT15
fatcat:lowz4pkqojbbzctxrx2w5bem4u
A Hybrid Fault Tolerance System for Distributed Environment using Check Point Mechanism and Replication
2017
International Journal of Computer Applications
The efficiency of the algorithm depends on how much replication is done and upto what extent the fault tolerance has been achieved. ...
We have here proposed a new method which uses both check point as well as the replication to ensure consistency in the distributed environment. Our method is also easy to implement. ...
In such a situation, inclusion of fault tolerance technique is essential. Fault Tolerance Techniques enable systems to perform tasks in the presence of faults [1] . ...
doi:10.5120/ijca2017912614
fatcat:ze5kjjc2wffm7ecyzjhidrvnfi
Rational Fair Consensus in the GOSSIP Model
[article]
2017
arXiv
pre-print
Furthermore, this fairness property must be guaranteed (with high probability) even in presence of any fixed coalition of rational agents that may deviate from the protocol in order to increase the winning ...
A protocol having this property, in presence of coalitions of size at most t, is said to be a whp -t-strong equilibrium. ...
They study the problem in the complete graph and in presence of dynamic patterns of crash faults. ...
arXiv:1705.09566v1
fatcat:jcam2rtdgbaelezjpfkzz2unya
Computer Science and Game Theory: A Brief Survey
[article]
2007
arXiv
pre-print
In this article I survey some of the main themes of work in the area, with a focus on the work in computer science. ...
There has been a remarkable increase in work at the interface of computer science and game theory in the past decade. ...
In fact, it is known that agreement can be reached in the presence of Byzantine failures iff t < n/3, that is, iff fewer than a third of the agents can be faulty [Pease et al. 1980 ]. ...
arXiv:cs/0703148v1
fatcat:wdcu7x6ppjhzvj2t5egyruv67u
URBAN FREIGHT CRASH ANALYSIS USING ORDINAL LOGIT AND ORDINAL PROBIT REGRESSION IN THE STATE OF ALABAMA
2019
International Journal for transport and traffic engineering
The analysis demonstrated the ability of the two models to determine influences and the models were in strong agreement of the variables, with distracted driving, driving too fast for conditions and fatigue ...
From the analysis, the variables that most likely increased the severity of urban truck at-fault crashes were fatigue and speed. ...
The study showed the need for increased accuracy in its findings; however, the results indicated the influence of driver behavior variables, presence of an intersection, head-on collisions, and presence ...
doi:10.7708/ijtte.2019.9(1).10
fatcat:uh3uang7gvaazfvs5b5uloyxy4
SoK: Understanding BFT Consensus in the Age of Blockchains
[article]
2021
IACR Cryptology ePrint Archive
Due to trust issues, it is hard to design a resilient system in practical situations because of the existence of various faults. ...
The distributed system community has extensively studied the technical components of consensus to reach agreement among a group of nodes. ...
Thus, it is desirable to design a reliable agreement protocol even in the presence of these kinds of faults. ...
dblp:journals/iacr/Wang21c
fatcat:wggbkbi25fg43fieebp4qzlk3m
Public acceptance and perception of autonomous vehicles: a comprehensive review
2021
AI and Ethics
This paper reviews the previous studies that focuses on testing the public acceptance and perception of AVs and sketches out the main trends in this area to provide some directions and recommendations ...
Thus, in the last few years, both research and industry have put significant efforts to develop AVs. ...
Fault tolerance systems for AVs The main objective of the FTC is to detect faults in the system and allow the system to perform conveniently even with the presence of some faults. ...
doi:10.1007/s43681-021-00041-8
pmid:34790943
pmcid:PMC7908960
fatcat:zvhucyzurfdjxll6yvk7x6eovu
Rational Uniform Consensus with General Omission Failures
[article]
2022
arXiv
pre-print
In this paper, we extend the game-theoretic analysis of consensus and design an algorithm of rational uniform consensus with general omission failures under the assumption that processes are controlled ...
In fact, strategic manipulations by rational agents do not be ignored for reaching consensus in distributed system. ...
Acknowledgment This work is supported by National Key R&D Program of China (2018YFC0832300;2018YFC0832303) ...
arXiv:2208.07740v1
fatcat:kioahxgaprbi5me6g6ugk5thrm
Mixed Fault Tolerance Protocols with Trusted Execution Environment
[article]
2022
arXiv
pre-print
Blockchain systems are designed, built and operated in the presence of failures. There are two dominant failure models, namely crash fault and Byzantine fault. ...
In general, mixed fault tolerance (MFT) protocols assume a network of n nodes, among which up to f = n-2/3 can be subject to mixed faults. ...
These protocols can achieve both safety and liveness in the presence of failures. ...
arXiv:2208.01946v1
fatcat:fkclfunqtrgvhn2qny4h7l2m7a
A Taxonomy of Blockchain Consensus Methods
2020
Cryptography
To assist researchers considering variations between them, this study presents a rational classification of consensus methods applied to current blockchains. ...
The study provides a survey of 19 methods classified by the scarce resource they employ: clock-cycles, bits, tokens, votes, time, and biometrics. ...
How these nodes communicate with one another and maintain truth in the presence of faults is known as consensus. ...
doi:10.3390/cryptography4040032
fatcat:5odh2nuv7veypo7cahu4tv5tui
A computer scientist looks at game theory
[article]
2002
arXiv
pre-print
I consider issues in distributed computation that should be of relevance to game theory. ...
In particular, I focus on (a) representing knowledge and uncertainty, (b) dealing with failures, and (c) specification of mechanisms. ...
Acknowledgments I would like to thank Ron Fagin, Yoram Moses, Ariel Rubinstein, Moshe Tennenholtz, and Moshe Vardi for useful comments on an earlier draft of this paper. ...
arXiv:cs/0201016v1
fatcat:r5rx6p4hzbgpjbysqniy5ayk2i
A computer scientist looks at game theory
2003
Games and Economic Behavior
I consider issues in distributed computation that should be of relevance to game theory. ...
In particular, I focus on (a) representing knowledge and uncertainty, (b) dealing with failures, and (c) specification of mechanisms. ...
Acknowledgments I would like to thank Ron Fagin, Yoram Moses, Ariel Rubinstein, Moshe Tennenholtz, and Moshe Vardi for useful comments on an earlier draft of this paper. ...
doi:10.1016/s0899-8256(02)00529-8
fatcat:eusmgqjbtvgz7h6qz2cojokr44
« Previous
Showing results 1 — 15 out of 6,197 results