{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T22:07:44Z","timestamp":1767046064583,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Research Foundation of Korea (NRF)","award":["RS-2021-NR059723"],"award-info":[{"award-number":["RS-2021-NR059723"]}]},{"name":"Institute of Information & communications Technology Planning & Evaluation (IITP)","award":["2022-0-00352, RS-2022-00155586"],"award-info":[{"award-number":["2022-0-00352, RS-2022-00155586"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,4,28]]},"DOI":"10.1145\/3696410.3714731","type":"proceedings-article","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T16:42:02Z","timestamp":1746463322000},"page":"5010-5021","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Ranking Items by the Current-Preferences and Profits: A List-wise Learning-to-Rank Approach to Profit Maximization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4104-9111","authenticated-orcid":false,"given":"Hong-Kyun","family":"Bae","sequence":"first","affiliation":[{"name":"Hanyang University, Seoul, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0592-6155","authenticated-orcid":false,"given":"Hae-Ri","family":"Jang","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6533-3469","authenticated-orcid":false,"given":"Won-Yong","family":"Shin","sequence":"additional","affiliation":[{"name":"Yonsei University, Seoul, Republic of Korea and POSTECH, Pohang, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6345-9084","authenticated-orcid":false,"given":"Sang-Wook","family":"Kim","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Amos Azaria Avinatan Hassidim Sarit Kraus Adi Eshkol Ofer Weintraub and Irit Netanely. 2013. Movie Recommender System for Profit Maximization. In ACM RecSys. 121--128.","DOI":"10.1145\/2507157.2507162"},{"key":"e_1_3_2_1_2_1","volume-title":"LANCER: A Lifetime-Aware News Recommender System. In AAAI. 4141--4148.","author":"Bae Hong-Kyun","year":"2023","unstructured":"Hong-Kyun Bae, Jeewon Ahn, Dongwon Lee, and Sang-Wook Kim. 2023. LANCER: A Lifetime-Aware News Recommender System. In AAAI. 4141--4148."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645681"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123642"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Zhe Cao Tao Qin Tie-Yan Liu Ming-Feng Tsai and Hang Li. 2007. Learning to rank: from pairwise approach to listwise approach. In ICML. 129--136.","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01442131"},{"key":"e_1_3_2_1_7_1","volume-title":"Duen Horng Chau, and Sang-Wook Kim","author":"Chae Dong-Kyu","year":"2020","unstructured":"Dong-Kyu Chae, Jihoo Kim, Duen Horng Chau, and Sang-Wook Kim. 2020. ARCF: Augmenting Virtual Users and Items in Collaborative Filtering for Addressing Cold-Start Problems. In ACM SIGIR. 1251--1260."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.09.027"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Xu Chen Hongteng Xu Yongfeng Zhang Jiaxi Tang Yixin Cao Zheng Qin and Hongyuan Zha. 2018. Sequential Recommendation with User Memory Networks. In ACM WSDM. 108--116.","DOI":"10.1145\/3159652.3159668"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Heng-Tze Cheng Levent Koc Jeremiah Harmsen Tal Shaked Tushar Chandra Hrishi Aradhye Glen Anderson Greg Corrado Wei Chai Mustafa Ispir et al. 2016. Wide & Deep Learning for Recommender Systems. In DLRS. 7--10.","DOI":"10.1145\/2988450.2988454"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Paul Covington Jay Adams and Emre Sargin. 2016. Deep Neural Networks for YouTube Recommendations. In ACM RecSys. 191--198.","DOI":"10.1145\/2959100.2959190"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Xiangnan He Kuan Deng Xiang Wang Yan Li Yongdong Zhang and Meng Wang. 2020. LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation. In ACM SIGIR. 639--648.","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_1_13_1","volume-title":"Neural Collaborative Filtering. In ACM Web Conference. 173--182","author":"He Xiangnan","year":"2017","unstructured":"Xiangnan He, Lizi Liao, Hanwang Zhang, Liqiang Nie, Xia Hu, and Tat-Seng Chua. 2017. Neural Collaborative Filtering. In ACM Web Conference. 173--182."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Balazs Hidasi and Alexandros Karatzoglou. 2018. Recurrent Neural Networks with Top-k Gains for Session-based Recommendations. In ACM CIKM. 843--852.","DOI":"10.1145\/3269206.3271761"},{"volume-title":"Collaborative Filtering for Implicit Feedback Datasets","author":"Hu Yifan","key":"e_1_3_2_1_15_1","unstructured":"Yifan Hu, Yehuda Koren, and Chris Volinsky. 2008. Collaborative Filtering for Implicit Feedback Datasets. In IEEE ICDM. 263--272."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Luo Ji Qi Qin Bingqing Han and Hongxia Yang. 2021. Reinforcement Learning to Optimize Lifetime Value in Cold-Start Recommendation. In ACM CIKM. 782--791.","DOI":"10.1145\/3459637.3482292"},{"key":"e_1_3_2_1_17_1","volume-title":"Adam: A Method for Stochastic Optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma. 2014. Adam: A Method for Stochastic Optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2021.3092768"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_20_1","first-page":"255","article-title":"M-BPR: A novel approach to improving BPR for recommendation with multi-type pair-wise preferences. Info","volume":"547","author":"Lee Yeon-Chang","year":"2021","unstructured":"Yeon-Chang Lee, Taeho Kim, Jaeho Choi, Xiangnan He, and Sang-Wook Kim. 2021. M-BPR: A novel approach to improving BPR for recommendation with multi-type pair-wise preferences. Info. Sci. 547 (2021), 255--270.","journal-title":"Sci."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Xiao Lin Hongjie Chen Changhua Pei Fei Sun Xuanji Xiao Hanxiao Sun Yongfeng Zhang Wenwu Ou and Peng Jiang. 2019. A Pareto-Efficient Algorithm for Multiple Objective Optimization in E-Commerce Recommendation. In ACM RecSys. 20--28.","DOI":"10.1145\/3298689.3346998"},{"key":"e_1_3_2_1_22_1","volume-title":"Lakshmanan","author":"Lu Wei","year":"2014","unstructured":"Wei Lu, Shanshan Chen, Keqian Li, and Laks V. S. Lakshmanan. 2014. Show Me the Money: Dynamic Recommendations for Revenue Maximization. In VLDB Endowment. 1785--1796."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/00913367.2019.1652123"},{"volume-title":"One-Class Collaborative Filtering","author":"Pan Rong","key":"e_1_3_2_1_24_1","unstructured":"Rong Pan, Yunhong Zhou, Bin Cao, Nathan N Liu, Rajan Lukose, Martin Scholz, and Qiang Yang. 2008. One-Class Collaborative Filtering. In IEEE ICDM. 502--511."},{"key":"e_1_3_2_1_25_1","volume-title":"Gbpr: Group Preference Based Bayesian Personalized Ranking for One-Class Collaborative Filtering. In IJCAI.","author":"Pan Weike","year":"2013","unstructured":"Weike Pan and Li Chen. 2013. Gbpr: Group Preference Based Bayesian Personalized Ranking for One-Class Collaborative Filtering. In IJCAI."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313404"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2007.07.016"},{"key":"e_1_3_2_1_28_1","volume-title":"BPR: Bayesian Personalized Ranking from Implicit Feedback. In UAI. 452--461.","author":"Rendle Steffen","year":"2009","unstructured":"Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009. BPR: Bayesian Personalized Ranking from Implicit Feedback. In UAI. 452--461."},{"key":"e_1_3_2_1_29_1","volume-title":"Factorizing Personalized Markov Chains for Next-Basket Recommendation. In ACM Web Conference. 811--820","author":"Rendle Steffen","year":"2010","unstructured":"Steffen Rendle, Christoph Freudenthaler, and Lars Schmidt-Thieme. 2010. Factorizing Personalized Markov Chains for Next-Basket Recommendation. In ACM Web Conference. 811--820."},{"key":"e_1_3_2_1_30_1","first-page":"1","article-title":"Multiobjective Pareto-Efficient Approaches for Recommender Systems","volume":"5","author":"Ribeiro Marco Tulio","year":"2014","unstructured":"Marco Tulio Ribeiro, Nivio Ziviani, Edleno Silva De Moura, Itamar Hata, Anisio Lacerda, and Adriano Veloso. 2014. Multiobjective Pareto-Efficient Approaches for Recommender Systems. ACM Trans. Inell. Syst. Technol. 5, 4 (2014), 1--20.","journal-title":"ACM Trans. Inell. Syst. Technol."},{"key":"e_1_3_2_1_31_1","volume-title":"Evolution Strategies as a Scalable Alternative to Reinforcement Learning. arXiv preprint arXiv:1703.03864","author":"Salimans Tim","year":"2017","unstructured":"Tim Salimans, Jonathan Ho, Xi Chen, Szymon Sidor, and Ilya Sutskever. 2017. Evolution Strategies as a Scalable Alternative to Reinforcement Learning. arXiv preprint arXiv:1703.03864 (2017)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Hongwei Wang Fuzheng Zhang Jialin Wang Miao Zhao Wenjie Li Xing Xie and Minyi Guo. 2018. RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systems. In ACM CIKM. 417--426.","DOI":"10.1145\/3269206.3271739"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Xiang Wang Xiangnan He Meng Wang Fuli Feng and Tat-Seng Chua. 2019. Neural Graph Collaborative Filtering. In ACM SIGIR. 165--174.","DOI":"10.1145\/3331184.3331267"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Liang Wu Diane Hu Liangjie Hong and Huan Liu. 2018. Turning Clicks into Purchases: Revenue Optimization for Product Search in E-Commerce. In ACM SIGIR. 365--374.","DOI":"10.1145\/3209978.3209993"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Yao Wu Christopher DuBois Alice X Zheng and Martin Ester. 2016. Collaborative Denoising Auto-Encoders for Top-N Recommender Systems. In ACM WSDM. 153--162.","DOI":"10.1145\/2835776.2835837"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Fen Xia Tie-Yan Liu Jue Wang Wensheng Zhang and Hang Li. 2008. Listwise Approach to Learning to Rank: Theory and Algorithm. In ICML. 1192--1199.","DOI":"10.1145\/1390156.1390306"},{"volume-title":"Analysis of the Time Complexity of Quick Sort Algorithm","author":"Xiang Wang","key":"e_1_3_2_1_37_1","unstructured":"Wang Xiang. 2011. Analysis of the Time Complexity of Quick Sort Algorithm. In IEEE ICIII. 408--410."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Lin Xiao Zhang Min Zhang Yongfeng Gu Zhaoquan Liu Yiqun and Ma Shaoping. 2017. Fairness-Aware Group Recommendation with Pareto-Efficiency. In ACM RecSys. 107--115.","DOI":"10.1145\/3109859.3109887"}],"event":{"name":"WWW '25: The ACM Web Conference 2025","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Sydney NSW Australia","acronym":"WWW '25"},"container-title":["Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714731","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696410.3714731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:41Z","timestamp":1750295921000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":38,"alternative-id":["10.1145\/3696410.3714731","10.1145\/3696410"],"URL":"https:\/\/doi.org\/10.1145\/3696410.3714731","relation":{},"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"2025-04-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}