【24h】

Generating Bids for Group-Related Actions in the Context of Prior Commitments

机译:在事先承诺的背景下为与小组相关的行为生成投标

获取原文
获取原文并翻译 | 示例

摘要

This paper addresses the problem of bid generation for a group decision-making mechanism based on a combinatorial auction in which agents bid on sets of tasks in a proposed group activity. It presents algorithms that an agent may use to generate temporal constraints for bids in such auctions. These constraints allow an agent making a bid to protect its private schedule of pre-existing commitments in case the bid is ultimately awarded. A task-integration-scheduling algorithm determines whether a new set of tasks can be merged into an agent's private schedule of pre-existing commitments. A temporal-constraint-generation algorithm generates the weakest set of temporal constraints (for inclusion in a bid) sufficient to protect the agent's modified schedule from any possible auction outcome. A proof of correctness for the temporal-constraint-generation algorithm is given. Both algorithms employ Simple Temporal Networks. Although the algorithms are presented in the context of a particular group decision-making mechanism, they have broader applicability to scenarios in which one agent makes an offer to other agents.
机译:本文讨论了一种基于组合拍卖的团体决策机制的出价生成问题,在组合拍卖中,代理商对拟议的团体活动中的任务集进行出价。它提出了代理可以用来为此类拍卖中的出价生成时间约束的算法。这些限制使代理可以进行投标以保护其私有的预先存在的承诺时间表,以防最终中标。任务集成调度算法确定是否可以将一组新任务合并到座席的预先承诺的私有调度中。时间约束生成算法会生成最弱的一组时间约束(用于包含在投标中),足以保护代理人的修改后的计划不受任何可能的拍卖结果的影响。给出了时间约束生成算法正确性的证明。两种算法都采用简单时间网络。尽管这些算法是在特定的群体决策机制的背景下提出的,但是它们在一个代理向其他代理提供要约的场景中具有更广泛的适用性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号