101 search results - page 12 / 21 » Approximation algorithms and online mechanisms for item pric... |
WWW
2008
ACM
15 years 10 months ago
2008
ACM
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
ATAL
2004
Springer
15 years 2 months ago
2004
Springer
Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among ...
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
90
Voted
SIAMJO
2008
14 years 9 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...