Search
Now showing items 1-2 of 2
Faithfulness in Internet Algorithms
(Association for Computing Machinery, 2004)
Proving or disproving faithfulness (a property describing robustness to rational manipulation in action as well as information revelation) is an appealing goal when reasoning about distributed systems containing rational ...
Specification Faithfulness in Networks with Rational Nodes
(Association for Computing Machinery, 2004)
It is useful to prove that an implementation correctly follows a specification. But even with a provably correct implementation, given a choice, would a node choose to follow it? This paper explores how to create distributed ...