Near-optimum online ad allocation for targeted advertising
Motivated by Internet targeted advertising, we address several ad allocation problems. Prior work has established that these problems admit no randomized online algorithm better than (1 −e 1 )-competitive (see Karp et al. (1990) and Mehta et al. (2007)), yet simple heuristics have been observed to p...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery
2018
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |