基于Stackelberg博弈的VANCENTRAL广告最优时间分配研究
Optimal Time Allocation in VANETs Advertising: A Price-based Approach using Stackelberg Game
摘要：
车载自组织网络（VANESTs）由于其巨大的潜力和应用，近年来引起了人们的广泛关注。广泛的覆盖范围和对最终用户的可访问性使VANESTO成为商业公司的良好目标。在本文中，我们考虑的情况下，广告公司的目的是传播他们的广告在不同地区的城市，利用VANESTIC基础设施。这些公司竞相租用温哥华的基础设施来传播他们的广告。我们将城市地图划分为不同的区块，并考虑所有区块的经理，负责在感兴趣的广告公司之间分配时间。每个广告公司（AdC）按分配的时间按比例收费。为了找到最佳的时间分配之间的AdCs，我们提出了一个Stackelberg游戏计划，其中块管理器分配的公司的块，并施加租金价格给不同的公司，以最大限度地提高自己的利润。在此基础上，AdC请求他们希望租用基础设施的时间量，以最大限度地提高其效用。为了获得Stackelberg均衡的游戏，一个混合整数非线性优化问题的解决，使用所提出的最优和次优算法。仿真结果表明，次优算法以较低的复杂度逼近最优算法。
英文摘要：
Vehicular ad-hoc networks (VANETs) have recently attracted a lot of attention due to their immense potentials and applications. Wide range of coverage and accessibility to end users make VANETs a good target for commercial companies. In this paper, we consider a scenario in which advertising companies aim to disseminate their advertisements in different areas of a city by utilizing VANETs infrastructure. These companies compete for renting the VANETs infrastructure to spread their advertisements. We partition the city map into different blocks, and consider a manager for all the blocks who is in charge of splitting the time between interested advertising companies. Each advertising company (AdC) is charged proportional to the allocated time. In order to find the best time splitting between AdCs, we propose a Stackelberg game scheme in which the block manager assigns the companies to the blocks and imposes the renting prices to different companies in order to maximize its own profit. Based on this, AdCs request the amount of time they desire to rent the infrastructure in order to maximize their utilities. To obtain the Stackelberg equilibrium of the game, a mixed integer nonlinear optimization problem is solved using the proposed optimal and sub-optimal algorithms. The simulation results demonstrate that the sub-optimal algorithm approaches the optimal one in performance with lower complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
