online matching has received significant attention over the last 15 years due
to its close connection to Internet advertising. As the seminal work of Karp,
Vazirani, and Vazirani has an optimal (1 - 1/e) competitive ratio in the
standard adversarial online model, much effort has gone i
本论文提出一种基于 Monte Carlo 采样的在线算法,在解决传播广告分配问题的同时,实现 competing ratio 为 0.702,也证明了当到达速率为整数时 competing ratio 为 0.705。同时,我们还证明采用已知分布模型无法实现 competing ratio 小于 0.823。