TY - GEN
T1 - Uncertain personal advertisement allocation for Mobile TV
AU - Adany, Ron
AU - Kraus, Sarit
AU - Ordonez, Fernando
PY - 2010
Y1 - 2010
N2 - In this paper we consider the problem of allocating personal TV advertisements when the viewers' viewing capacities are uncertain. We focus on the Mobile TV medium as a personal platform taking into account special constraints that are motivated by the TV medium. Since the problem is NP-Hard, we present a sequential solution procedure and propose several heuristic algorithms for solving it. Through computational experiments on different scenarios of uncertainty, the performances of these heuristics were compared to the performance in the deterministic case where the actual viewing capacities are known in advance. The performance of these heuristics was close to that of the deterministic even for scenarios where uncertainty was very high while the Com-binedRatingRobust algorithm seems to be the best for most scenarios. In general, the heuristic algorithms that consider uncertainty in advance seem to be preferable over those that only adapt to it after it has been discovered. Though this paper is oriented for Mobile TV, the proposed algorithms are suitable for other personal push-advertisement methods such as SMS (Short Message Service) and MMS (Multimedia Messaging Service).
AB - In this paper we consider the problem of allocating personal TV advertisements when the viewers' viewing capacities are uncertain. We focus on the Mobile TV medium as a personal platform taking into account special constraints that are motivated by the TV medium. Since the problem is NP-Hard, we present a sequential solution procedure and propose several heuristic algorithms for solving it. Through computational experiments on different scenarios of uncertainty, the performances of these heuristics were compared to the performance in the deterministic case where the actual viewing capacities are known in advance. The performance of these heuristics was close to that of the deterministic even for scenarios where uncertainty was very high while the Com-binedRatingRobust algorithm seems to be the best for most scenarios. In general, the heuristic algorithms that consider uncertainty in advance seem to be preferable over those that only adapt to it after it has been discovered. Though this paper is oriented for Mobile TV, the proposed algorithms are suitable for other personal push-advertisement methods such as SMS (Short Message Service) and MMS (Multimedia Messaging Service).
UR - https://www.scopus.com/pages/publications/79956289577
U2 - 10.1145/1971519.1971548
DO - 10.1145/1971519.1971548
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:79956289577
SN - 9781450304405
T3 - MoMM2010 - 8th International Conference on Advances in Mobile Computing and Multimedia
SP - 159
EP - 166
BT - MoMM2010 - 8th International Conference on Advances in Mobile Computing and Multimedia
T2 - 8th International Conference on Advances in Mobile Computing and Multimedia, MoMM2010
Y2 - 8 November 2010 through 10 November 2010
ER -