Fair Assortment Planning
Qinyi Chen, Negin Golrezaei, Fransisca Susan

TL;DR
This paper introduces a fair assortment planning framework that enforces equality of opportunity among items, formulates it as a linear program, and develops polynomial-time approximation algorithms with practical numerical validation.
Contribution
It formulates a novel fair assortment problem as a linear program and proposes efficient approximation algorithms based on the Ellipsoid method and knapsack problem structures.
Findings
The LP formulation effectively models fairness in assortment planning.
The proposed algorithms achieve a 1/2 approximation ratio and an FPTAS.
Numerical studies demonstrate the algorithms' effectiveness and reveal the platform's price of fairness.
Abstract
Many online platforms, ranging from online retail stores to social media platforms, employ algorithms to optimize their offered assortment of items (e.g., products and contents). These algorithms often focus exclusively on achieving the platforms' objectives, highlighting items with the highest popularity or revenue. This approach, however, can compromise the equality of opportunities for the rest of the items, in turn leading to less content diversity and increased regulatory scrutiny for the platform. Motivated by this, we introduce and study a fair assortment planning problem that enforces equality of opportunities via pairwise fairness, which requires any two items to be offered similar outcomes. We show that the problem can be formulated as a linear program (LP), called (FAIR), that optimizes over the distribution of all feasible assortments. To find a near-optimal solution to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPublic Procurement and Policy
