Open Access. Powered by Scholars. Published by Universities.®

Business Commons

Open Access. Powered by Scholars. Published by Universities.®

Advertising and Promotion Management

Singapore Management University

Series

Outdoor Advertising

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Business

Optimizing Impression Counts For Outdoor Advertising, Yipeng Zhang, Yuchen Li, Zhifeng Bao, Songsong Mo, Ping Zhang Aug 2019

Optimizing Impression Counts For Outdoor Advertising, Yipeng Zhang, Yuchen Li, Zhifeng Bao, Songsong Mo, Ping Zhang

Research Collection School Of Computing and Information Systems

In this paper we propose and study the problem of optimizing theinfluence of outdoor advertising (ad) when impression counts aretaken into consideration. Given a database U of billboards, each ofwhich has a location and a non-uniform cost, a trajectory databaseT and a budget B, it aims to find a set of billboards that has themaximum influence under the budget. In line with the advertisingconsumer behavior studies, we adopt the logistic function to takeinto account the impression counts of an ad (placed at differentbillboards) to a user trajectory when defining the influence measurement. However, this poses two challenges: (1) our problemis …


Trajectory-Driven Influential Billboard Placement, Ping Zhang, Zhifeng Bao, Yuchen Li, Guoliang Li, Yipeng Zhang, Zhiyong Peng Aug 2018

Trajectory-Driven Influential Billboard Placement, Ping Zhang, Zhifeng Bao, Yuchen Li, Guoliang Li, Yipeng Zhang, Zhiyong Peng

Research Collection School Of Computing and Information Systems

In this paper we propose and study the problem of trajectory-driven influential billboard placement: given a set of billboards U (each with a location and a cost), a database of trajectories T and a budget L, find a set of billboards within the budget to influence the largest number of trajectories. One core challenge is to identify and reduce the overlap of the influence from different billboards to the same trajectories, while keeping the budget constraint into consideration. We show that this problem is NP-hard and present an enumeration based algorithm with (1−1/e) approximation ratio. However, the enumeration should be …