Online Conversion with Group Fairness Constraints

In this paper, we initiate the study of an online conversion problem that incorporates group fairness guarantees. This problem aims to distribute a resource with fixed capacity to a sequence of buyers based on their offered prices. Each buyer belongs to a distinct group, and the objective is to maximize revenue while ensuring fairness across groups by guaranteeing that each group receives a predetermined quantity of resources. We propose a novel threshold-based online algorithm and prove that it achieves the optimal competitive ratio with fairness guarantees.