Sciweavers

SIGECOM
2008
ACM
144views ECommerce» more  SIGECOM 2008»
13 years 3 months ago
Incentives for expressing opinions in online polls
Prediction markets efficiently extract and aggregate the private information held by individuals about events and facts that can be publicly verified. However, facts such as the e...
Radu Jurca, Boi Faltings
SIGECOM
2008
ACM
127views ECommerce» more  SIGECOM 2008»
13 years 3 months ago
Posted prices vs. negotiations: an asymptotic analysis
Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...
Liad Blumrosen, Thomas Holenstein
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 3 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 3 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
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...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
SIGECOM
2008
ACM
94views ECommerce» more  SIGECOM 2008»
13 years 3 months ago
Optimizing query rewrites for keyword-based advertising
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
Azarakhsh Malekian, Chi-Chao Chang, Ravi Kumar, Gr...
SIGECOM
2008
ACM
92views ECommerce» more  SIGECOM 2008»
13 years 3 months ago
Strong regularities in online peer production
Online peer production systems have enabled people to coactively create, share, classify, and rate content on an unprecedented scale. This paper describes strong macroscopic regul...
Dennis M. Wilkinson
SIGECOM
2008
ACM
108views ECommerce» more  SIGECOM 2008»
13 years 3 months ago
Optimal envy-free pricing with metric substitutability
Ning Chen, Arpita Ghosh, Sergei Vassilvitskii
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
13 years 3 months ago
A sufficient condition for voting rules to be frequently manipulable
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
Lirong Xia, Vincent Conitzer
SIGECOM
2008
ACM
141views ECommerce» more  SIGECOM 2008»
13 years 3 months ago
On the communication requirements of verifying the VCG outcome
We consider the amount of communication required to verify the outcome of the Vickrey-Clarke-Groves (VCG) mechanism: an efficient allocation together with incentivizing VCG paymen...
Sébastien Lahaie, David C. Parkes