We study the problem of computing optimal prices for a version of the Product-Mix auction with budget constraints. In contrast to the ``standard'' Product-Mix auction, the objective is to maximize revenue instead of social welfare. We prove correctness of an algorithm proposed by Paul Klemperer and DotEcon which is sufficiently efficient in smaller markets.
翻译:与“标准产品混合”拍卖相比,我们的目标是最大限度地增加收入而不是社会福利。 我们证明保罗·克莱默尔和多顿提出的算法是正确的,在较小的市场中算法效率相当高。