Sciweavers

32 search results - page 3 / 7
» Approximate mechanism design without money
Sort
View
USENIX
2007
13 years 10 months ago
POTSHARDS: Secure Long-Term Storage Without Encryption
Users are storing ever-increasing amounts of information digitally, driven by many factors including government regulations and the public’s desire to digitally record their per...
Mark W. Storer, Kevin M. Greenan, Ethan L. Miller,...
WSDM
2010
ACM
166views Data Mining» more  WSDM 2010»
14 years 5 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...
FOCS
2008
IEEE
14 years 2 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
SIGECOM
2004
ACM
132views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
A dynamic pari-mutuel market for hedging, wagering, and information aggregation
I develop a new mechanism for risk allocation and information speculation called a dynamic pari-mutuel market (DPM). A DPM acts as hybrid between a pari-mutuel market and a contin...
David M. Pennock
DAC
2006
ACM
14 years 8 months ago
Shielding against design flaws with field repairable control logic
Correctness is a paramount attribute of any microprocessor design; however, without novel technologies to tame the increasing complexity of design verification, the amount of bugs...
Ilya Wagner, Valeria Bertacco, Todd M. Austin