2911 search results - page 79 / 583 » A Theory of Expressiveness in Mechanisms |
135
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
158
click to vote
JOLLI
2008
15 years 6 months ago
2008
The aim of this article is to investigate whether choosing the appropriate referring expression requires taking into account the hearer's perspective, as is predicted under so...
156
click to vote
LICS
1991
IEEE
15 years 9 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
193
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
188
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...