Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Computationally feasible VCG mechanisms
Proceedings of the 2nd ACM conference on Electronic commerce
TCP congestion control with a misbehaving receiver
ACM SIGCOMM Computer Communication Review
Distributed Algorithms
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Antisocial Agents and Vickrey Auctions
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
ICSE '81 Proceedings of the 5th international conference on Software engineering
Iterative combinatorial auctions: achieving economic and computational efficiency
Iterative combinatorial auctions: achieving economic and computational efficiency
Specification faithfulness in networks with rational nodes
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Incentives in BitTorrent induce free riding
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Clustering and sharing incentives in BitTorrent systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Dandelion: cooperative content distribution with robust incentives
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Bittorrent is an auction: analyzing and improving bittorrent's incentives
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Proceedings of the 3rd international workshop on Economics of networked systems
Design of Application-Specific Incentives in P2P Networks
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
Collaboration in BitTorrent Systems
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
EquiCast: Scalable multicast with selfish users
Computer Networks: The International Journal of Computer and Telecommunications Networking
Information security economics - and beyond
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Resisting free-riding behavior in BitTorrent
Future Generation Computer Systems
RatFish: a file sharing protocol provably secure against rational users
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Distributed algorithmic mechanism design for scheduling on unrelated machines
Journal of Parallel and Distributed Computing
Do incentives build robustness in bit torrent
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Mutually controlled routing with independent ISPs
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
N-party BAR Transfer: motivation, definition, and challenges
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
A taxonomy of rational attacks
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Denial-of-service attacks and countermeasures on BitTorrent
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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 a less formal approach and take some first steps in faithfulness analysis for existing algorithms running on the Internet. To this end, we consider the expected faithfulness of BitTorrent, a popular file download system, and show how manual backtracing (similar to the the ideas behind program slicing [22]) can be used to find rational manipulation problems. Although this primitive technique has serious drawbacks, it can be useful in disproving faithfulness.Building provably faithful Internet protocols and their corresponding specifications can be quite difficult depending on the system knowledge assumptions and problem complexity. We present some of the open problems that are associated with these challenges.