Lucia Mazzali

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Consider a set of items and a set of m colors, where each item is associated to one color. Consider also n computational agents connected by an arbitrary graph. Each agent initially holds a subset of the items. We analyze the problem of distributively assigning colors to agents in such a way that (a) each color is assigned to one agent only and (b) the(More)
  • 1