TY - GEN
T1 - Multistakeholder recommendation with provider constraints
AU - Sürer, Özge
AU - Burke, Robin
AU - Malthouse, Edward C.
N1 - Publisher Copyright:
© 2018 Association for Computing Machinery.
Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.
PY - 2018/9/27
Y1 - 2018/9/27
N2 - Recommender systems are typically designed to optimize the utility of the end user. In many settings, however, the end user is not the only stakeholder and this exclusive focus may produce unsatisfactory results for other stakeholders. One such setting is found in multisided platforms, which bring together buyers and sellers. In such platforms, it may be necessary to jointly optimize the value for both buyers and sellers. This paper proposes a constraint-based integer programming optimization model, in which different sets of constraints are used to reflect the goals of the different stakeholders. This model is applied as a post-processing step, so it can easily be added onto an existing recommendation system to make it multistakeholder aware. For computational tractability with larger data sets, we reformulate the integer problem using the Lagrangian dual and use subgradient optimization. In experiments with two data sets, we evaluate empirically the interaction between the utilities of buyers and sellers and show that our approximation can achieve good upper and lower bounds in practical situations.
AB - Recommender systems are typically designed to optimize the utility of the end user. In many settings, however, the end user is not the only stakeholder and this exclusive focus may produce unsatisfactory results for other stakeholders. One such setting is found in multisided platforms, which bring together buyers and sellers. In such platforms, it may be necessary to jointly optimize the value for both buyers and sellers. This paper proposes a constraint-based integer programming optimization model, in which different sets of constraints are used to reflect the goals of the different stakeholders. This model is applied as a post-processing step, so it can easily be added onto an existing recommendation system to make it multistakeholder aware. For computational tractability with larger data sets, we reformulate the integer problem using the Lagrangian dual and use subgradient optimization. In experiments with two data sets, we evaluate empirically the interaction between the utilities of buyers and sellers and show that our approximation can achieve good upper and lower bounds in practical situations.
KW - Constraint-based Recommendation
KW - Multisided Platforms
KW - Multistakeholder Recommendation
UR - http://www.scopus.com/inward/record.url?scp=85056759733&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85056759733&partnerID=8YFLogxK
U2 - 10.1145/3240323.3240350
DO - 10.1145/3240323.3240350
M3 - Conference contribution
AN - SCOPUS:85056759733
T3 - RecSys 2018 - 12th ACM Conference on Recommender Systems
SP - 54
EP - 62
BT - RecSys 2018 - 12th ACM Conference on Recommender Systems
PB - Association for Computing Machinery, Inc
T2 - 12th ACM Conference on Recommender Systems, RecSys 2018
Y2 - 2 October 2018 through 7 October 2018
ER -