Skip to search formSkip to main contentSkip to account menu

Distributed algorithmic mechanism design

Known as: Distributed algorithmic game theory 
Distributed algorithmic mechanism design (DAMD) is an extension of algorithmic mechanism design. DAMD differs from Algorithmic mechanism design since… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Most discussions of algorithmic mechanism design (AMD) presume the existence of a trusted center that implements the required… 
2014
2014
In this paper, we formulate and solve the selfish allocation problem by using game theory, which is different from the previously… 
2012
2012
  • Fang ZuoWei Zhang
  • 2012
  • Corpus ID: 18464357
In this work, we formulate and solve the selfish allocation problem in P2P file application. We design and analyze a strategy… 
2012
2012
In this paper, we focus and solve the selfish allocation-problem that is different from the previously studied version in three… 
2009
2009
  • F. Kerschbaum
  • 2009
  • Corpus ID: 2665429
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is… 
Review
2008
Review
2008
Distributed peer-to-peer file-sharing systems rely on volu ntary contribution of resources (files and bandwidth) from the… 
2008
2008
Distributed algorithmic mechanism design is a field at the intersection of computer science and economics. 
2005
2005
The Internet has emerged as the global platform for computation and communication. It offers nearly unlimited resources that… 
2004
2004
We investigate the relation between budget balance and communication for the multicast cost-sharing problem in the context of… 
2004
2004
Traditional network protocols such as TCP/IP require cooperation between traffic sources to achieve optimal network performance…