Distributed algorithmic mechanism design: recent results and future directions

  • Authors:
  • Joan Feigenbaum;Scott Shenker

  • Affiliations:
  • Yale University, New Haven, CT;ICSI, Berkeley, CA

  • Venue:
  • DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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..