#### Filter Results:

#### Publication Year

2013

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We consider sequential <i>balls-into-bins</i> processes that randomly allocate <i>m</i> balls into <i>n</i> bins. We analyze two allocation schemes that achieve a close to optimal maximum load of ⌈<i>m</i>/<i>n</i>⌉ + 1 and require only <i>O(m)</i> (expected) allocation time. These parameters should be compared with the classic… (More)

We consider the problem of fair allocation of indivisible goods where we are given a set I of m indivisible resources (items) and a set P of n customers (players) competing for the resources. Each resource j ∈ I has a same value v j > 0 for a subset of customers interested in j and it has no value for other customers. The goal is to find a feasible… (More)

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)

- ‹
- 1
- ›