  A set of objects is to be divided fairly among agents with different tastes,
modeled by additive utility-functions. An agent is allowed to share a bounded
number of objects between two or more agents in order to attain fairness.
  The paper studies various notions of fairness, such as proportionality,
envy-freeness, equitability, and consensus. We analyze the run-time complexity
of finding a fair allocation with a given number of sharings under several
restrictions on the agents' valuations, such as: binary generalized-binary and
non-degenerate.
