Jump to content

Distributed algorithmic mechanism design

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by FrescoBot (talk | contribs) at 21:03, 13 March 2010 (Bot: links syntax). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Distributed algorithmic mechanism design (DAMD) is an extension of algorithmic mechanism design.

DAMD differs from Algorithmic mechanism design since the algorithm is computed in a distributed manner rather than by a central authority. This greatly improves computation time since the burden is shared by all agents within a network

One major obstacle in DAMD is ensuring that agents reveal the true costs or preferences related to a given scenario. Often times these agents would rather lie in order to improve his or her own utility. A number of solutions apply to Algorithmic mechanism design but not to DAMD since DAMD does not require a central authority figure.

See also

  • [1] Distributed Algorithmic Mechanism Design: Recent Results and Future Directions
  • [2] Distributed algorithmic mechanism design and network security
  • [3] Service Allocation in Selfish Mobile Ad Hoc Networks Using Vickrey Auction