{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:28:39Z","timestamp":1760059719233,"version":"build-2065373602"},"reference-count":36,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This paper addresses the problem of information extraction using an AI-powered chatbot. The problem concerns searching and extracting relevant information from large databases in response to a human user\u2019s query. Expanding the traditional discrete search problem well known in operations research, this problem introduces two players; the first player\u2014an AI chatbot such as ChatGPT 4.0\u2014sequentially scans available datasets to find an appropriate answer to a given query, while the second\u2014a human user\u2014conducts a dialogue with the chatbot and evaluates its answers in each round of the dialogue. The goal of an AI-powered chatbot is to provide maximally useful and accurate information. During a natural language conversation between a human user and an AI, the human user can modify and refine queries until s\/he is satisfied with the chatbot\u2019s output. We analyze two key characteristics of human\u2013AI interaction: search reliability and efficiency. Search reliability is defined as the ability of a robot to understand user queries and provide correct answers; it is measured by the frequency (probability) of correct answers. Search efficiency of a chatbot indicates how accurate and relevant the information returned by the chatbot is; it is measured by the satisfaction level a human user receives for a correct answer. An AI chatbot must perform a sequence of scans over the given databases and continue searching until the human user declares, in some round, that the target has been found. Assuming that the chatbot is not completely reliable, each database may have to be scanned infinitely often; in this case, the objective of the problem is to determine a search policy for finding the optimal sequence of chatbot scans that maximizes the expected user satisfaction over an infinite time horizon. Along with these results, we found a counterintuitive relationship between AI chatbot reliability and search performance: under sufficiently general conditions, a less reliable AI chatbot may have higher expected search efficiency; this phenomenon aligns with other well-known \u201cmore-for-less\u201d paradoxes. Finally, we discussed the underlying mechanism of this paradox.<\/jats:p>","DOI":"10.3390\/a18070412","type":"journal-article","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T10:45:11Z","timestamp":1751539511000},"page":"412","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of Reliability and Efficiency of Information Extraction Using AI-Based Chatbot: The More-for-Less Paradox"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0430-408X","authenticated-orcid":false,"given":"Eugene","family":"Levner","sequence":"first","affiliation":[{"name":"School of Computer Science, Faculty of Sciences, Holon Institute of Technology, Holon 58102, Israel"}]},{"given":"Boris","family":"Kriheli","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Ashkelon Academic College, Ashkelon 78211, Israel"}]}],"member":"1968","published-online":{"date-parts":[[2025,7,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Nicolescu, L., and Tudorache, M.T. (2022). Human-Computer Interaction in Customer Service: The Experience with AI Chatbots\u2014A Systematic Literature Review. Electronics, 11.","DOI":"10.3390\/electronics11101579"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"803","DOI":"10.3390\/ai5020041","article-title":"Error Correction and Adaptation in Conversational AI: A Review of Techniques and Applications in Chatbots","volume":"5","author":"Izadi","year":"2024","journal-title":"AI"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2961","DOI":"10.3390\/jtaer19040142","article-title":"Business and Customer-Based Chatbot Activities: The Role of Customer Satisfaction in Online Purchase Intention and Intention to Reuse Chatbots","volume":"19","author":"Akdemir","year":"2024","journal-title":"J. Theor. Appl. Electron. Commer. Res."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Alabbas, A., and Alomar, K. (2025). A Weighted Composite Metric for Evaluating User Experience in Educational Chatbots: Balancing Usability, Engagement, and Effectiveness. Future Internet, 17.","DOI":"10.3390\/fi17020064"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1287\/opre.17.6.984","article-title":"A problem in optimal search and stop","volume":"17","author":"Ross","year":"1969","journal-title":"Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1446","DOI":"10.1214\/aoms\/1177696790","article-title":"Sequential Search with Discounted Income, the Discount a Function of the Cell Searched","volume":"41","author":"Sweat","year":"1970","journal-title":"Ann. Math. Stat."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.21.3.741","article-title":"Optimal Stopping in a Discrete Search Problem","volume":"21","author":"Chew","year":"1973","journal-title":"Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Ross, S.M. (1983). Introduction to Stochastic Dynamic Programming, Academic Press.","DOI":"10.1016\/B978-0-12-598420-1.50006-4"},{"key":"ref_9","first-page":"241","article-title":"Infinite-horizon scheduling algorithms for optimal search for hidden objects","volume":"1","author":"Levner","year":"1994","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10479-019-03141-1","article-title":"Scheduling an autonomous robot searching for hidden targets","volume":"Volume 298","author":"Cheng","year":"2019","journal-title":"Annals of Operations Research"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1287\/opre.4.3.324","article-title":"The theory of search, II. Target detection","volume":"4","author":"Koopman","year":"1956","journal-title":"Oper. Res."},{"key":"ref_12","unstructured":"Stone, L.D. (1976). Theory of Optimal Search, Elsavier."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Stone, L.D., Royset, J.O., and Washburn, A.R. (2016). Optimal Search for Moving Targets, Springer Nature.","DOI":"10.1007\/978-3-319-26899-6"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1287\/opre.34.2.324","article-title":"Technical Note\u2014The Complexity of the Optimal Searcher Path Problem","volume":"34","author":"Trummel","year":"1986","journal-title":"Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0020-0190(85)90108-5","article-title":"Optimal search with positive switch cost is NP-hard","volume":"21","author":"Wegener","year":"1985","journal-title":"Inf. Process. Lett."},{"key":"ref_16","first-page":"153","article-title":"Optimal Search for Hidden Targets by Unmanned Aerial Vehicles under Imperfect Inspections","volume":"6","author":"Kriheli","year":"2016","journal-title":"Am. J. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s00186-007-0197-2","article-title":"Optimal discrete search with imperfect specificity","volume":"68","author":"Kress","year":"2008","journal-title":"Math. Methods Oper. Res."},{"key":"ref_18","unstructured":"Osborne, M.J., and Rubinstein, A. (1994). A Course in Game Theory, MIT Press."},{"key":"ref_19","unstructured":"Clarkson, J., Lin, K.Y., and Glazebrook, K.D. (2021). A classical search game in discrete locations. arXiv."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/THMS.2021.3131684","article-title":"A Review of Human\u2013Machine Cooperation in the Robotics Domain","volume":"52","author":"Yang","year":"2021","journal-title":"IEEE Trans. Human-Machine Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10514-021-10023-8","article-title":"Bayes\u2013Nash: Bayesian inference for Nash equilibrium selection in human-robot parallel play","volume":"46","author":"Bansal","year":"2021","journal-title":"Auton. Robot."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"56590","DOI":"10.1109\/ACCESS.2020.2981978","article-title":"Analysis and augmentation of human performance on telerobotic search problems","volume":"8","author":"Tseng","year":"2020","journal-title":"IEEE Access"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3665319","article-title":"Human-Robot Team Performance Compared to Full Robot Autonomy in 16 Real-World Search and Rescue Missions: Adaptation of the DARPA Subterranean Challenge","volume":"14","author":"Robinson","year":"2024","journal-title":"ACM Trans. Human-Robot Interact."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/trsc.17.3.301","article-title":"The Prevalence of Braess\u2019 Paradox","volume":"17","author":"Steinberg","year":"1983","journal-title":"Transp. Sci."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Shan, F., Li, H., Wang, Z., Jin, M., and Chen, D. (2024). Optimizing Rural Highway Maintenance Scheme with Mathematical Programming. Appl. Sci., 14.","DOI":"10.3390\/app14188253"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"5396","DOI":"10.1038\/s41467-022-32917-6","article-title":"Understanding Braess\u2019 paradox in power grids","volume":"13","author":"Pesch","year":"2022","journal-title":"Nat. Commun."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/cplx.21736","article-title":"When slower is faster","volume":"21","author":"Gershenson","year":"2015","journal-title":"Complexity"},{"key":"ref_28","unstructured":"Boaz, T., and Ben-Porat, O. (2024). Braess\u2019s Paradox of Generative AI. arXiv."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Sorrell, S. (2009). Exploring Jevons\u2019 Paradox. Energy Efficiency and Sustainable Consumption: The Rebound Effect, Palgrave Macmillan.","DOI":"10.1057\/9780230583108_7"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1080\/23251042.2015.1106060","article-title":"Understanding the Jevons paradox","volume":"2","author":"York","year":"2015","journal-title":"Environ. Sociol."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.orl.2004.10.007","article-title":"The no-wait flow-shop paradox","volume":"33","author":"Spieksma","year":"2005","journal-title":"Oper. Res. Lett."},{"key":"ref_32","first-page":"11","article-title":"The more-for-less paradox in the distribution model","volume":"13","author":"Charnes","year":"1971","journal-title":"Cah. Cent. D\u2019etudes Re-Cherch. Op\u00e9rationnelle"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on Multiprocessing Timing Anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"ref_34","unstructured":"Ross, S.M. (1976). A First Course in Probability, Macmillan."},{"key":"ref_35","first-page":"319","article-title":"Perspectives of approximate dynamic programming","volume":"Volume 298","author":"Powell","year":"2012","journal-title":"Annals of Operations Research"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"17298814211007305","DOI":"10.1177\/17298814211007305","article-title":"Reinforcement learning for robot research: A comprehensive review and open issues","volume":"18","author":"Zhang","year":"2021","journal-title":"Int. J. Adv. Robot. Syst."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/7\/412\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:04:09Z","timestamp":1760033049000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/7\/412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,3]]},"references-count":36,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,7]]}},"alternative-id":["a18070412"],"URL":"https:\/\/doi.org\/10.3390\/a18070412","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2025,7,3]]}}}