Sciweavers

153 search results - page 5 / 31
» Warrant without truth
Sort
View
FOCS
2008
IEEE
14 years 5 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...
PST
2008
14 years 9 days ago
The Uncertainty of the Truth
Can we trust without any reliable truth information? Most trust architectures work in a similar way: a trustor makes some observations, rates the trustee, and makes recommendations...
Michel Deriaz
PSSS
2003
14 years 7 days ago
Inferencing and Truth Maintenance in RDF Schema
Contrary to earlier reports in literature, exhaustive forward inferencing is a feasible approach for practical RDF. It is sufficiently fast and the increase in necessary storage s...
Jeen Broekstra, Arjohn Kampman
SIGECOM
2009
ACM
83views ECommerce» more  SIGECOM 2009»
14 years 5 months ago
The price of truthfulness for pay-per-click auctions
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...
Nikhil R. Devanur, Sham M. Kakade
MOBIHOC
2009
ACM
14 years 5 months ago
Revenue generation for truthful spectrum auction in dynamic spectrum access
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...
Juncheng Jia, Qian Zhang, Qin Zhang, Mingyan Liu