101 search results - page 8 / 21 » Approximation algorithms and online mechanisms for item pric... |
SODA
2001
ACM
14 years 10 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and study a natural bidding heuristic in which advertisers attempt to o...
104
click to vote
AAAI
2008
14 years 11 months ago
2008
We propose an expressive auction design that allows advertisers to specify the kinds of demographics and websites they wish to target within an advertising network. The design all...
118
click to vote
PODS
2012
ACM
12 years 12 months ago
2012
ACM
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
ESA
2007
Springer
15 years 3 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...