Fetching the paper…
Reading the bibliography…
This paper aims to investigate and achieve seller-side fairness within online marketplaces, where many sellers and their items are not sufficiently exposed to customers in an e-commerce platform.
Adwords and generalized online matching
Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani · 2007
Earlier work this paper cites.
The adwords problem: online keyword matching with budgeted bidders under random permutations
Nikhil R Devanur and Thomas P Hayes · 2009
Earlier work this paper cites.
Online stochastic packing applied to display ad allocation
Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S Mirrokni, and Cliff Stein · 2010
Earlier work this paper cites.
Contextual bandits with linear payoff functions
Wei Chu, Lihong Li, Lev Reyzin, and Robert Schapire · 2011
Earlier work this paper cites.
The price of fairness
Dimitris Bertsimas, Vivek F Farias, and Nikolaos Trichakis · 2011
Earlier work this paper cites.
An empirical evaluation of thompson sampling
Olivier Chapelle and Lihong Li · 2011
Earlier work this paper cites.
Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms
Lihong Li, Wei Chu, John Langford, and Xuanhui Wang · 2011
Earlier work this paper cites.
Fairness-aware classifier with prejudice remover regularizer
Toshihiro Kamishima, Shotaro Akaho, Hideki Asoh, and Jun Sakuma · 2012
Earlier work this paper cites.
On the efficiency-fairness trade-off
Dimitris Bertsimas, Vivek F Farias, and Nikolaos Trichakis · 2012
Earlier work this paper cites.
Thompson sampling for contextual bandits with linear payoffs
Shipra Agrawal and Navin Goyal · 2013
Earlier work this paper cites.
Repeated auctions with budgets in ad exchanges: Approximations and design
Santiago R Balseiro, Omar Besbes, and Gabriel Y Weintraub · 2015
Cited alongside, same era.
Equality of opportunity in supervised learning
Moritz Hardt, Eric Price, and Nati Srebro · 2016
Cited alongside, same era.
Introduction to online convex optimization
Elad Hazan et al · 2016
Cited alongside, same era.
Beyond parity: Fairness objectives for collaborative filtering
Sirui Yao and Bert Huang · 2017
Cited alongside, same era.
Data decisions and theoretical implications when adversarially learning fair representations
Alex Beutel, Jilin Chen, Zhe Zhao, and Ed H Chi · 2017
Cited alongside, same era.
Fa* ir: A fair top-k ranking algorithm
Meike Zehlike, Francesco Bonchi, Carlos Castillo, Sara Hajian, Mohamed Megahed, and Ricardo Baeza-Yates · 2017
Fighting fire with fire: Using antidote data to improve polarization and fairness of recommender systems
Bashir Rastegarpanah, Krishna P Gummadi, and Mark Crovella · 2019
Later among the works it cites.
Managing popularity bias in recommender systems with personalized re-ranking
Himan Abdollahpouri, Robin Burke, and Bamshad Mobasher · 2019
Later among the works it cites.
Controlling fairness and bias in dynamic learning-to-rank
Marco Morik, Ashudeep Singh, Jessica Hong, and Thorsten Joachims · 2020
Later among the works it cites.
User-oriented fairness in recommendation
Yunqi Li, Hanxiong Chen, Zuohui Fu, Yingqiang Ge, and Yongfeng Zhang · 2021
Later among the works it cites.
Regularized online allocation problems: Fairness and beyond
Santiago Balseiro, Haihao Lu, and Vahab Mirrokni · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Controlling popularity bias in learning-to-rank recommendation
Himan Abdollahpouri, Robin Burke, and Bamshad Mobasher · 2017
Cited alongside, same era.
How algorithmic confounding in recommendation systems increases homogeneity and decreases utility
Allison JB Chaney, Brandon M Stewart, and Barbara E Engelhardt · 2018
Cited alongside, same era.
A fairness-aware hybrid recommender system
Golnoosh Farnadi, Pigi Kouki, Spencer K Thompson, Sriram Srinivasan, and Lise Getoor · 2018
Cited alongside, same era.
Equity of attention: Amortizing individual fairness in rankings
Asia J Biega, Krishna P Gummadi, and Gerhard Weikum · 2018
Cited alongside, same era.
ecommerce events history in electronics store
Micheal Kechinov
Cited in the paper.
Evaggelia Pitoura, Kostas Stefanidis, and Georgia Koutrika · 2022
Later among the works it cites.
Bypassing the monster: A faster and simpler optimal algorithm for contextual bandits under realizability
David Simchi-Levi and Yunzong Xu · 2022
Later among the works it cites.
Cold start to improve market thickness on online advertising platforms: Data-driven algorithms and field experiments
Zikun Ye, Dennis J Zhang, Heng Zhang, Renyu Zhang, Xin Chen, and Zhiwei Xu · 2023
Closest in time.
The best of many worlds: Dual mirror descent for online allocation problems
Santiago R Balseiro, Haihao Lu, and Vahab Mirrokni · 2023
Closest in time.