Connecting consumers with relevant products is a very important problem in
both online and offline commerce. In physical retail, product placement is an
effective way to connect consumers with products. However,
通过在线广告分配,我们从理论和实践角度研究在线随机装箱线性规划。我们首先展示了一种近似最优的在线算法,证明了基于训练的简单原始对偶算法在随机顺序随机模型下实现(1 - o (1)) 逼近担保,这是对同一问题敌对变量的对数或常数逼近的显著改进;然后,我们侧重于在线显示广告分配问题,研究了各种基于训练和在线分配算法在实际数据集上的效率和公平性。我们的实验评估确认了基于训练的原始对偶算法在真实数据集上的有效性,并指出公平性和效率之间的内在权衡。