48 search results - page 9 / 10 » sigecom 2008 |
SIGECOM
2008
ACM
13 years 7 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
2008
ACM
13 years 7 months ago
2008
ACM
Computer users express a strong desire to prevent attacks and to reduce the losses from computer and information security breaches. However, security compromises are common and wi...
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
SIGECOM
2008
ACM
13 years 7 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...
SIGECOM
2008
ACM
13 years 7 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...