Distributed algorithmic mechanism design
Top Cited Papers
- 28 September 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
Distributed Algorithmic Mechanism Design (DAMD) combines theoretical computer science's traditional focus on computational tractability with its more recent interest in incentive compatibility and distributed computing. The Internet's decentralized nature, in which distributed computation and autonomous agents prevail, makes DAMD a very natural approach for many Internet problems. This paper first outlines the basics of DAMD and then reviews previous DAMD results on multicast cost sharing and interdomain routing. The remainder of the paper describes several promising research directions and poses some specific open problems..Keywords
This publication has 44 references indexed in Scilit:
- Risk communicationPublished by Taylor & Francis ,2002
- Sharing the Cost of Multicast TransmissionsJournal of Computer and System Sciences, 2001
- An analysis of BGP convergence propertiesACM SIGCOMM Computer Communication Review, 1999
- Biased Replacement Policies for Web Caches: Differential Quality-of-Service and Aggregate User ValueSSRN Electronic Journal, 1999
- Economic principles of multi-agent systemsArtificial Intelligence, 1997
- Architecting noncooperative networksIEEE Journal on Selected Areas in Communications, 1995
- A Concept of Egalitarianism Under Participation ConstraintsEconometrica, 1989
- Incentives in TeamsEconometrica, 1973
- Multipart pricing of public goodsPublic Choice, 1971
- COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERSThe Journal of Finance, 1961