PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions

Abstract

We consider the problem of allocating a set I of m indivisible resources (items) to a set P of n customers (players) competing for the resources. Each resource j ∈ I has a same value vj > 0 for a subset of customers interested in j, and zero value for the remaining customers. The utility received by each customer is the sum of the values of the resources… (More)

Topics

6 Figures and Tables

Slides referencing similar topics