Sciweavers

48 search results - page 6 / 10
» sigecom 2008
Sort
View
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 9 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
103views ECommerce» more  SIGECOM 2008»
13 years 9 months ago
Mechanism design over discrete domains
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
Ahuva Mu'alem, Michael Schapira
SIGECOM
2008
ACM
141views ECommerce» more  SIGECOM 2008»
13 years 9 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
SIGECOM
2008
ACM
94views ECommerce» more  SIGECOM 2008»
13 years 9 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...