Distributed algorithmic mechanism design: recent results and future directions

By Joan Feigenbaum, Scott Shenker. DIALM '02, 2002

461 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/6559d9de0cea0d0c883eaee964f1bd601516034e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Management Science and Operations Research

Citations in the corpus

BAR fault tolerance for cooperative services (2005, background): “Game theory [25] has a long history in the economics literature [4, 28, 41] and has recently become of general interest in computer science [3, 20, 22, 23, 45, 48, 61].”
Tussle in cyberspace: defining tomorrow's Internet (2002, background): “Recently, there has been an influx of interest from a systems perspective on the computational [26] and network [27] underpinnings of such systems.”
Fairplay - Secure Two-Party Computation System (2004, background): “SFE offers a solution for unmediated e-commerce applications such as auctions and web services [32, 17].”
Overcoming free-riding behavior in peer-to-peer systems (2005, methodology): “AMD has been further extended to distributed algorithmic mechanism design (DAMD) by [Feigenbaum and Shenker, 2002].”
Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents (2003, background): “An excellent survey on the state of the art in distributed algorithmic mechanism design can be found in [15].”
Robust incentive techniques for peer-to-peer networks (2004, background): “Distributed Algorithmic Mechanism Design seeks solutions within this framework that are both fully distributed and computationally tractable [12].”
A Survey of Peer-to-Peer Security Issues (2002, background): “This is an instance of a problem in distributed algorithm mechanism design [17].”
Mechanism Design via Differential Privacy (2007, unknown): “Feigenbaum and Shenker [18] mention investigating study of approximate notions of truthfulness, including -dominance, as a major open problem.”
Efficient learning equilibrium (2004, background): “can agents strategically modify messages sent by others?) see [23, 8, 27] for various ways of approaching these issues).”
Computational-Mechanism Design: A Call to Arms (2003, background): “28 A debate already exists about why open P2P systems such as KaZaa work at all given the incentives for users to free-ride.”
Towards Sharp Inapproximability For Any 2-CSP (2007, unknown): “Feigenbaum and Shenker [18] mention investigating study of approximate notions of truthfulness, including -dominance, as a major open problem.”
Rational secret sharing and multiparty computation: extended abstract (2004, background): “These re-sults can be viewed as steps in the program advocated in [11] of unifying the strategic model and computational model in distributed algorithmic mechanism design.”