Resource Allocation Among Agents with MDP-Induced Preferences

Abstract

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.

References in corpus (2)

• On the Complexity of Solving Markov Decision Problems
• Resource Allocation Among Agents with MDP-Induced Preferences

Cited by in corpus (6)

• Resource Allocation Among Agents with MDP-Induced Preferences
• Formal Modelling for Multi-Robot Systems Under Uncertainty
• A Coordinated MDP Approach to Multi-Agent Planning for Resource Allocation, with Applications to Healthcare
• Finite-Horizon Markov Decision Processes with State Constraints
• Resource-Driven Mission-Phasing Techniques for Constrained Agents in Stochastic Environments
• Finite-Horizon Markov Decision Processes with Sequentially-Observed Transitions