Search

Skip to Search Results
  • Spring 2020

    Maryam Mahboub

    In this thesis, we study approximation algorithms for graph pricing where we have a set of items V and a set of customers X where each customer i in X has a budget b(i) and is interested in a bundle of items S(i) subset V with |S(i)| <= 2. However, there is a limited supply of each item: we only...

1 - 1 of 1