We study online combinatorial auctions with production costs proposed by Blum
et al. using the online primal dual framework. In this model, buyers arrive
online, and the seller can produce multiple copies of each
研究了在线分配问题,通过创建不对称性来控制重用性引起的随机依赖,并建立了一个新算法,获得了最佳竞争比率。(The paper studies the problem of online allocation and proposes a new algorithm that creates asymmetry to control the stochastic dependencies induced by reusability, achieving the best possible competitive ratio.)