 
Summary: How to Sell a Graph:
Guidelines for Graph Retailers
Alexander Grigoriev1
, Joyce van Loon1,
, RenŽe Sitters2
, and Marc Uetz1
1
Maastricht University, Quantitative Economics,
P.O. Box 616, NL6200 MD Maastricht, The Netherlands
{a.grigoriev, j.vanloon, m.uetz}@ke.unimaas.nl
2
MaxPlanck Institute fšur Informatik, Algorithms and Complexity,
Stuhlsatzenhausweg 85, 66123 Saarbršucken, Germany
sitters@mpiinf.mpg.de
Abstract. We consider a profit maximization problem where we are
asked to price a set of m items that are to be assigned to a set of n
customers. The items can be represented as the edges of an undirected
(multi)graph G, where an edge multiplicity larger than one corresponds
to multiple copies of the same item. Each customer is interested in pur
chasing a bundle of edges of G, and we assume that each bundle forms a
