...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Discrete Applied Mathematics >The partition bargaining problem
【24h】

The partition bargaining problem

机译：分区议价问题

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

摘要

Consider the problem of partitioning n items among d players where the utility of each player for bundles of items is additive; so, player r has utility v(r)(i) for item i and the utility of that player for a bundle of items is the sum of the v(i)(r)'s over the items i in his/her bundle. Each partition S of the items is then associated with a d-dimensional utility vector V-S whose coordinates are the utilities that the players assign to the bundles they get under S. Also, lotteries over partitions are associated with the corresponding expected utility vectors. We model the problem as a Nash bargaining game over the set of lotteries over partitions and provide methods for computing the corresponding Nash solution, to prescribed accuracy, with effort that is polynomial in n. In particular, we show that points in the pareto-optimal set of the corresponding bargaining set correspond to lotteries over partitions under which each item, with the possible exception of at most d(d-1)/2 items, is assigned in the same way. (C) 2007 Elsevier B.V. All rights reserved.
机译：考虑一下在d个玩家之间分配n个物品的问题，其中每个玩家对物品束的效用是可加的;因此，玩家r拥有物品i的效用v（r）（i），而该玩家物品一捆的效用是其捆绑中物品i上v（i）（r）的总和。物品的每个分区S然后与d维效用向量V-S相关联，该维向量的坐标是玩家分配给他们在S下获得的束的效用。此外，分区上的彩票与对应的期望效用向量相关联。我们将该问题建模为针对分区上的彩票集合的Nash讨价还价博弈，并提供了用于计算相应Nash解法的方法，达到规定的精度，且努力次数为n。特别是，我们表明相应议价集的“最优”集合中的点对应于分区上的彩票，在该分区上，每个项目（最多可能有d（d-1）/ 2个项目）被分配到同一区域办法。 （C）2007 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号