DMCA
Distributed Algorithmic Mechanism Design: Recent Results and Future Directions (2002)
Cached
Download Links
| Citations: | 283 - 24 self |
BibTeX
@MISC{Feigenbaum02distributedalgorithmic,
author = {Joan Feigenbaum and Scott Shenker},
title = {Distributed Algorithmic Mechanism Design: Recent Results and Future Directions },
year = {2002}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
Keyphrases
future direction abstract distributed algorithmic mechanism design recent result incentive compatibility autonomous agent many internet problem distributed computation theoretical computer science traditional focus subject descriptor computational tractability research direction specific open problem recent interest algorithmic mechanism design natural approach previous damd result interdomain routing multicast cost sharing
