Sciweavers

Share
IPTPS
2003
Springer

Rationality and Self-Interest in Peer to Peer Networks

9 years 3 months ago
Rationality and Self-Interest in Peer to Peer Networks
Much of the existing work in peer to peer networking assumes that users will follow prescribed protocols without deviation. This assumption ignores the user’s ability to modify the behavior of an algorithm for self-interested reasons. We advocate a different model in which peer to peer users are expected to be rational and selfinterested. This model is found in the emergent fields of Algorithmic Mechanism Design (AMD) and Distributed Algorithmic Mechanism Design (DAMD), both of which introduce game-theoretic ideas into a computational system. We, as designers, must create systems (peer to peer search, routing, distributed auctions, resource allocation, etc.) that allow nodes to behave rationally while still achieving good overall system outcomes. This paper has three goals. The first is to convince the reader that rationality is a real issue in peer to peer networks. The second is to introduce mechanism design as a tool that can be used when designing networks with rational nodes....
Jeffrey Shneidman, David C. Parkes
Added 07 Jul 2010
Updated 07 Jul 2010
Type Conference
Year 2003
Where IPTPS
Authors Jeffrey Shneidman, David C. Parkes
Comments (0)
books