500 search results - page 2 / 100 » On the Hardness of Being Truthful |
FUIN
2010
13 years 3 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
SIGECOM
2008
ACM
13 years 4 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
SIGECOM
2004
ACM
13 years 10 months ago
2004
ACM
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...
FUZZIEEE
2007
IEEE
13 years 11 months ago
2007
IEEE
— The algebra of truth values of type-2 fuzzy sets contains isomorphic copies of the algebra of truth values of type1 fuzzy sets and the algebra of truth values of interval-value...
XSYM
2005
Springer
13 years 10 months ago
2005
Springer
XQuery is a feature-rich language with complex semantics. This makes it hard to come up with a benchmark suite which covers all performance-critical features of the language, and a...