Maximizing the Utility in Location-Based Mobile Advertising

Nowadays, the locations and contexts of users are easily accessed by mobile advertising brokers, and the brokers can send customers related location-based advertisement. In this paper, we consider a location-based advertising problem, namely maximum utility advertisement assignment (MUAA) problem, with the estimation of the interests of customers and the contexts of the vendors, we want to maximize the overall utility of ads by determining the ads sent to each customer subject to the constraints of the capacities of customers, the distance ranges and the budgets of vendors. We prove that the MUAA problem is NP-hard and intractable. Thus, we propose one offline approach, namely the reconciliation approach, which has an approximation ratio of (1-ε)⋅θ, where θ = min(a_1\n^c_1, a_2 n^c_2,..., a_m n^c_m), and n^c_i is the larger value between the number of valid vendors and the capacity a_i of customer u_i. Experiments on real data sets confirm the efficiency and effectiveness of our proposed approach.

[1]  Christian S. Jensen,et al.  Moving spatial keyword queries: Formulation, methods, and analysis , 2013, TODS.

[2]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[3]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[4]  Daqing Zhang,et al.  Modeling User Activity Preference by Leveraging User Spatial Temporal Characteristics in LBSNs , 2015, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[5]  Upkar Varshney,et al.  Challenges and business models for mobile location-based services and advertising , 2011, Commun. ACM.

[6]  Francesco Pozzi,et al.  Exponential smoothing weighted correlations , 2012 .

[7]  K. Chowdhury,et al.  CONSUMER ATTITUDE TOWARD MOBILE ADVERTISING IN AN EMERGING MARKET: AN EMPIRICAL STUDY , 2006 .

[8]  Prabhakant Sinha,et al.  The Multiple-Choice Knapsack Problem , 1979, Oper. Res..