Citation Context

...he TCS literature traditionally did the opposite. The emergence of the Internet as a standard platform for distributed computation has radically changed this state of affairs: Ownership, operation, and use by many selfinterested, independent parties give the Internet the characteristics of an economy as well as those of a computer. This development requires that these previously separable concerns – incentive compatibility and computational tractability – be jointly addressed. Although many subdisciplines of computer science have a long history of using game theory — such as networking (e.g., [21, 25, 35]), distributed artificial intelligence (e.g., [55, 61]), and marketbased computation (e.g., [65]) — the first work in TCS to address incentives and computational complexity simultaneously was Nisan and Ronen’s seminal paper [52] on algorithmic mechanism design (AMD). This paper put forth a formal model of centralized computation that combined incentive compatibility (the “mechanism design” part) with computational tractability (the “algorithmic” part). Feigenbaum, Papadimitriou, and Shenker [20] extended this to distributed algorithmic mechanism design (DAMD), in which the same goals of incent...

Citation Context

...ly, the impact of negative externalities, e.g., from congestion, has been extensively investigated in the context of pricing for both communication networks [9, 14, 16, 18] and transportation systems =-=[2, 12, 15]-=-. Systems that exhibit both positive and negative externalities have been studied mostly in the context of the theory of clubs [17]. Club-like behaviors also arise in peer-to-peer (p2p) systems where ...