Overview and details of the sessions of this conference. Please select a date or location to show only sessions at that day or location. Please select a single session for detailed view (with abstracts and downloads if available).
1Massachusetts Institute of Technology, United States of America; 2Institut Teknologi Bandung, Indonesia
Discussant: Omar El Housni (Cornell University)
We introduce and study a fair assortment planning problem, where any two products with similar merits are offered similar visibility. We propose a framework to find near-optimal solutions to this problem, using the Ellipsoid method and a separation oracle to its dual. We then develop two approximate separation oracles, which result in a polynomial-time 1/2-approx. algorithm and an FPTAS for our problem. We conclude with a case study on a movie dataset, showing the efficacy of our algorithms.
Fair dynamic rationing
Vahideh Manshadi1, Rad Niazadeh2, Scott Rodilitz3
1Yale School of Management; 2University of Chicago, Booth School of Business; 3Stanford Graduate School of Business
Discussant: Gad Allon (University of Pennsylvania)
Social planners often aim to equitably and efficiently ration a social good among agents whose (possibly correlated) demands realize sequentially. We design a simple adaptive policy that simultaneously achieves the best-possible guarantees on the expected minimum fill rate and the minimum expected fill rate, where each agent's fill rate is determined by an irrevocable, one-time allocation. We complement our results with a numerical study motivated by the rationing of COVID-19 medical supplies.
