1 paper
Zachary Friggstad, Maryam Mahboub
We study approximation algorithms for graph pricing with vertex capacities yet without the traditional envy-free constraint. Specifically, we have a set of items V and a set of c…