@InProceedings{feigenbaum02a,
  author =	 {Joan Feigenbaum and Scott Shenker},
  title =	 {Distributed Algorithmic Mechanism Design: Recent
                  Results and Future Directions},
  googleid =	 {FGhP5rFKtr4J:scholar.google.com/},
  booktitle =	 {Proceedings of the 6th International Workshop on
                  Discrete Algorithms and Methods for Mobile Computing
                  and Communications},
  pages =	 {1--13},
  year =	 2002,
  publisher =	 {ACM Press, New York},
  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 =     {mechanism-design networks survey},
  url =		 {http://jmvidal.cse.sc.edu/library/feigenbaum02a.pdf},
  cluster = 	 {13742253440901277716}
}