arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1110.2767cs.MAcs.AI
收藏

基于MDP诱导偏好的Agent间资源分配

Resource Allocation Among Agents with MDP-Induced Preferences

Toyota Technical Center(丰田技术中心);University of Michigan(密歇根大学)

D. A. Dolgov, E. H. Durfee

摘要:

在代理之间分配稀缺资源以最大化全局效用通常在计算上具有挑战性。我们专注于资源使代理在随机环境中执行动作的问题,建模为马尔可夫决策过程(MDP),这样的资源束的值被定义为给定这些资源的最佳MDP策略可实现的预期值。我们提出了一个算法,同时解决资源分配和政策优化问题。这使我们能够避免显式地表示指数级多个资源束上的效用,从而导致计算复杂性的急剧(通常是指数级)降低。然后,我们使用这个算法的情况下,自利代理设计一个组合拍卖分配资源。我们经验性地证明了我们的方法的有效性,表明它可以在几分钟内,最佳地解决问题,一个简单的组合资源分配技术将需要代理枚举多达2^100个资源束和拍卖解决NP完全问题的输入大小。

英文摘要:

Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute actions in stochastic environments, modeled as Markov decision processes (MDPs), such that the value of a resource bundle is defined as the expected value of the optimal MDP policy realizable given these resources. We present an algorithm that simultaneously solves the resource-allocation and the policy-optimization problems. This allows us to avoid explicitly representing utilities over exponentially many resource bundles, leading to drastic (often exponential) reductions in computational complexity. We then use this algorithm in the context of self-interested agents to design a combinatorial auction for allocating resources. We empirically demonstrate the effectiveness of our approach by showing that it can, in minutes, optimally solve problems for which a straightforward combinatorial resource-allocation technique would require the agents to enumerate up to 2^100 resource bundles and the auctioneer to solve an NP-complete problem with an input of that size.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑