DeepAI AI Chat
Log In Sign Up

Fair packing of independent sets

by   Nina Chiarelli, et al.

In this work we add a graph theoretical perspective to a classical problem of fairly allocating indivisible items to several agents. Agents have different profit valuations of items and we allow an incompatibility relation between pairs of items described in terms of a conflict graph. Hence, every feasible allocation of items to the agents corresponds to a partial coloring, that is, a collection of pairwise disjoint independent sets. The sum of profits of vertices/items assigned to one color/agent should be optimized in a maxi-min sense. We derive complexity and algorithmic results for this problem, which is a generalization of the classical Partition and Independent Set problems. In particular, we show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs.


page 1

page 2

page 3

page 4


Approximating Bin Packing with Conflict Graphs via Maximization Techniques

We give a comprehensive study of bin packing with conflicts (BPC). The i...

Graphical House Allocation

The classical house allocation problem involves assigning n houses (or i...

Stochastic Non-Bipartite Matching Models and Order-Independent Loss Queues

The need for matching items with one another while meeting assignment co...

Role Coloring Bipartite Graphs

A k-role coloring alpha of a graph G is an assignment of k colors to the...

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth

A graph is O_k-free if it does not contain k pairwise vertex-disjoint an...

Coloring Problems on Bipartite Graphs of Small Diameter

We investigate a number of coloring problems restricted to bipartite gra...

Prophet Inequalities on the Intersection of a Matroid and a Graph

We consider prophet inequalities in a setting where agents correspond to...