103
click to vote
SIGECOM
15 years 6 months ago
2010 ACM
Current automated market makers over binary events suffer from two problems that make them impractical. First, they are unable to adapt to liquidity, so trades cause prices to mo...
103
click to vote
SIGECOM
15 years 6 months ago
2010 ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
129
click to vote
ECWEB
15 years 2 months ago
2010 Springer
Abstract. Many current recommender systems exploit textual annotations (tags) provided by users to retrieve and suggest online contents. The text-based recommendation provided by t...
100
click to vote
SIGECOM
15 years 6 months ago
2010 ACM
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
106
click to vote
SIGECOM
15 years 6 months ago
2010 ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
|