Personal advertisement allocation for mobile TV

  • Authors:
  • Ron Adany;Sarit Kraus;Fernando Ordóñez

  • Affiliations:
  • Bar-Ilan University, Ramat-Gan, Israel;Bar-Ilan University, Ramat-Gan, Israel;University of Southern California, Los Angeles, CA

  • Venue:
  • Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Personal advertisements are the next-generation in the world of advertisement. In this article we consider the personal advertisement allocation problem with constraints that are motivated by the TV and Mobile advertisement worlds. This problem is a version of the Generalized Multi-Assignment Problem, defined as an extension of GAP with assignment restrictions and all-or-nothing constraints. We present an Integer Programming (IP) model of the problem, prove that it is an NP-hard problem, and propose heuristic algorithms to solve it. Through computational experiments, we compare the performance of these heuristics to solutions obtained with IP solvers. We show that the Backtrack Heuristic outperforms the others and on average it attains 98% of the possible revenue. Though this paper is Mobile TV oriented, the results suit any other personal advertisement "push" method in the mobile market such as SMS (Short Message Service) and MMS (Multimedia Messaging Service).