• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems(IEA/AIE 2007); 20070626-29; Kyoto(JP) >Combinatorial Auction with Minimal Resource Requirements
【24h】

Combinatorial Auction with Minimal Resource Requirements

机译：最少资源需求的组合拍卖

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Although combinatorial auction has been studied extensively, it is difficult to apply the existing results to a problem with minimal resource requirements. In this paper, we consider a combinatorial auction problem in which an auctioneer wants to acquire resources from a set of bidders to process the tasks on hand. Each task requires a minimal set of resources for executing the operations. Each bidder owns a set of resources to bid for the tasks. The problem is to determine the resource assignment to minimize the total cost to perform the tasks. The main results include: (1) a problem formulation for combinatorial auction with minimal resource requirements; (2) a solution methodology based on Lagrangian relaxation; (3) an economic interpretation and a proposed structure for implementing our solution algorithms.
机译：尽管组合拍卖已被广泛研究，但是难以将现有结果应用于资源需求最少的问题。在本文中，我们考虑一个组合拍卖问题，在该问题中，拍卖师希望从一组竞标者那里获取资源以处理手头的任务。每个任务都需要最少的资源集来执行操作。每个竞标者都拥有一组资源来竞标任务。问题在于确定资源分配以最小化执行任务的总成本。主要结果包括：（1）在资源需求最少的情况下进行组合拍卖的问题公式； （2）基于拉格朗日松弛的解决方法； （3）一种经济的解释，以及为实现我们的求解算法而提出的结构。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号