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 &#8968;<i>m</i>/<i>n</i>&#8969; + 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)
  • 1