Jump to content

Distributed algorithmic mechanism design

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Godspeed! phi (talk | contribs) at 17:40, 16 March 2008 (Created page with ''''Distributed algorithmic mechanism design''' (DAMD) is an extension of Algorithmic mechansim design. '''Distributed algorithmic mechanis...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

Distributed algorithmic mechanism design differs from Algorithmic mechansim design since the algorithm is computed in a distributed manner rather than by a central authority. This greatly improves Computational_complexity#Computational_resources 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 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 a central authority is not present.

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