Faithfulness in Internet Algorithms (2004) [20 citations — 2 self]
Download:
http://www.eecs.harvard.edu/~jeffsh/pubs/pins2004/
http://www.eecs.harvard.edu/econcs/pubs/pins04.pdf
CACHED:
http://www.eecs.harvard.edu/~jeffsh/pubs/pins2004/
http://www.eecs.harvard.edu/econcs/pubs/pins04.pdf
CACHED:
by
Jeffrey Shneidman
,
David C. Parkes
,
Laurent Massoulie
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Shneidman04faithfulnessin,
author = {Jeffrey Shneidman and David C. Parkes and Laurent Massoulie},
title = {Faithfulness in Internet Algorithms},
year = {2004}
}
author = {Jeffrey Shneidman and David C. Parkes and Laurent Massoulie},
title = {Faithfulness in Internet Algorithms},
year = {2004}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
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 participants. Recent work formalizes the notion of faithfulness and its foundation properties, and presents a general proof technique in the course of proving the ex post Nash faithfulness of a theoretical routing problem [11]. In this paper, we use...
