Sciweavers

28962 search results - page 192 / 5793
» Computational Mechanism Design
Sort
View
MOR
2010
118views more  MOR 2010»
15 years 2 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
TSMC
2010
14 years 11 months ago
Grid Resource Negotiation: Survey and New Directions
Abstract--Since Grid computing systems involve large-scale resource sharing, resource management is central to their operations. Whereas there are more Grid resource management sys...
Kwang Mong Sim
ATAL
2010
Springer
15 years 5 months ago
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori...
WSDM
2010
ACM
166views Data Mining» more  WSDM 2010»
16 years 1 months ago
Ranking Mechanisms in Twitter-Like Forums
We study the problem of designing a mechanism to rank items in forums by making use of the user reviews such as thumb and star ratings. We compare mechanisms where forum users rat...
Anish Das Sarma, Atish Das Sarma, Sreenivas Gollap...
CCS
2010
ACM
15 years 4 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov