32607 search results - page 6323 / 6522 » Supporting the supporters |
194
click to vote
SIGECOM
2008
ACM
15 years 6 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...
181
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
For the problem of allocating one or more items among a group of competing agents, the Vickrey-Clarke-Groves (VCG) mechanism is strategy-proof and efficient. However, the VCG mech...
178
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
184
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
Search personalization has been pursued in many ways, in order to provide better result rankings and better overall search experience to individual users [5]. However, blindly app...
145
click to vote
RPTEL
2006
15 years 6 months ago
2006
This paper takes one step towards addressing the question of how activity mediated by shared representations--notations that are manipulated by more than one person during a collab...