首页> 外文会议> >Optimal Auctions for Multi-Unit Procurement with Volume Discount Bids
【24h】

Optimal Auctions for Multi-Unit Procurement with Volume Discount Bids

机译:带有批量折扣出价的多单元采购的最优拍卖

获取原文

摘要

Our attention is focused on designing an optimal procurement mechanism which a buyer can use for procuring multiple units of a homogeneous item based on bids submitted by autonomous, rational, and intelligent suppliers. We design elegant optimal procurement mechanisms for two different situations. In the first situation, each supplier specifies the maximum quantity that can be supplied together with a per unit price. For this situation, we design an optimal mechanism S-OPT (Optimal with Simple bids). In the more generalized case, each supplier specifies discounts based on the volume of supply. In this case, we design an optimal mechanism VD-OPT (Optimal with Volume Discount bids). The VD-OPT mechanism uses the S-OPT mechanism as a building block. The proposed mechanisms minimize the cost to the buyer, satisfying at the same time, (a) Bayesian incentive compatibility and (b) interim individual rationality.
机译:我们的注意力集中在设计一种最佳的采购机制上,买方可以根据自主,理性和智能的供应商提交的投标,使用该机制采购同质商品的多个单位。我们针对两种不同情况设计了优雅的最佳采购机制。在第一种情况下,每个供应商都指定了可以提供的最大数量以及每单位价格。针对这种情况,我们设计了一种最优机制S-OPT(带有简单出价的最优机制)。在更普遍的情况下,每个供应商都根据供应量指定折扣。在这种情况下,我们设计了一种最佳机制VD-OPT(具有批量折扣出价的最佳机制)。 VD-OPT机制使用S-OPT机制作为构建块。拟议的机制将买方的成本降到最低,同时满足(a)贝叶斯激励相容性和(b)临时个人理性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号