{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:27:23Z","timestamp":1743089243868,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030891879"},{"type":"electronic","value":"9783030891886"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89188-6_1","type":"book-chapter","created":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T22:02:23Z","timestamp":1635112943000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Designing Bounded Min-Knapsack Bandits Algorithm for Sustainable Demand Response"],"prefix":"10.1007","author":[{"given":"Akansha","family":"Singh","sequence":"first","affiliation":[]},{"given":"P. Meghana","family":"Reddy","sequence":"additional","affiliation":[]},{"given":"Shweta","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Sujit","family":"Gujar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,25]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Devanur, N.R.: Bandits with concave rewards and convex knapsacks. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 989\u20131006 (2014)","DOI":"10.1145\/2600057.2602844"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Akasiadis, C., et al.: Incentives for rescheduling residential electricity consumption to promote renewable energy usage. In: 2015 SAI Intelligent Systems Conference (IntelliSys), pp. 328\u2013337, November 2015","DOI":"10.1109\/IntelliSys.2015.7361163"},{"key":"1_CR3","unstructured":"Anderson, R., Fuloria, S.: On the security economics of electricity metering. In: Proceedings of the WEIS (2010)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Chao, H.: Competitive electricity markets with consumer subscription service in a smart grid. J. Regul. Econ. 1\u201326 (2012)","DOI":"10.1007\/s11149-011-9179-7"},{"key":"1_CR5","unstructured":"Chen, W., Hu, W., Li, F., Li, J., Liu, Y., Lu, P.: Combinatorial multi-armed bandit with general reward functions. Adv. Neural Inf. Process. Syst. 29, 1659\u20131667 (2016)"},{"key":"1_CR6","unstructured":"Chen, W., Wang, Y., Yuan, Y.: Combinatorial multi-armed bandit: General framework and applications. In: International Conference on Machine Learning, pp. 151\u2013159 (2013)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Chen, X., Nie, Y., Li, N.: Online residential demand response via contextual multi-armed bandits. arXiv preprint arXiv:2003.03627 (2020)","DOI":"10.1109\/LCSYS.2020.3003190"},{"key":"1_CR8","unstructured":"Csirik, J.: Heuristics for the 0\u20131 min-knapsack problem. Acta Cybernetica 10(1\u20132), 15\u201320 (1991)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Gai, Y., Krishnamachari, B., Jain, R.: Combinatorial network optimization with unknown variables: multi-armed bandits with linear rewards and individual observations. IEEE\/ACM Trans. Netw. 20(5), 1466\u20131478 (2012)","DOI":"10.1109\/TNET.2011.2181864"},{"key":"1_CR10","unstructured":"Gurobi Optimization L: Gurobi optimizer reference manual (2021). http:\/\/www.gurobi.com"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Hsu, Y.Y., Su, C.C.: Dispatch of direct load control using dynamic programming. IEEE Trans. Power Syst. 6(3), 1056\u20131061 (1991)","DOI":"10.1109\/59.119246"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Jain, S., Balakrishnan, N., Narahari, Y., Hussain, S.A., Voo, N.Y.: Constrained t\u00e2tonnement for fast and incentive compatible distributed demand management in smart grids. In: Proceedings of the Fourth International Conference on Future Energy Systems, pp. 125\u2013136. ACM (2013)","DOI":"10.1145\/2487166.2487180"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Jain, S., Gujar, S., Bhat, S., Zoeter, O., Narahari, Y.: A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing. Artif. Intell. 254, 44\u201363 (2018)","DOI":"10.1016\/j.artint.2017.10.001"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Jain, S., Narayanaswamy, B., Narahari, Y.: A multiarmed bandit incentive mechanism for crowdsourcing demand response in smart grids (2014)","DOI":"10.1609\/aaai.v28i1.8806"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Li, Y., Hu, Q., Li, N.: Learning and selecting the right customers for reliability: a multi-armed bandit approach (2018)","DOI":"10.1109\/CDC.2018.8619481"},{"key":"1_CR16","unstructured":"Ma, H., Parkes, D.C., Robu, V.: Generalizing demand response through reward bidding. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, pp. 60\u201368. AAMAS 2017, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2017)"},{"key":"1_CR17","unstructured":"Ma, H., Robu, V., Li, N.L., Parkes, D.C.: Incentivizing reliability in demand-side response. In: the proceedings of The 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pp. 352\u2013358 (2016)"},{"key":"1_CR18","unstructured":"Methenitis, G., Kaisers, M., La Poutr\u00e9, H.: Forecast-based mechanisms for demand response. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1600\u20131608. International Foundation for Autonomous Agents and Multiagent Systems (2019)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Mittal, S., Schulz, A.S.: An FPTAS for optimizing a class of low-rank functions over a polytope. Math. Program. 141(1\u20132), 103\u2013120 (2013)","DOI":"10.1007\/s10107-011-0511-x"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.energy.2015.02.057","volume":"83","author":"S Park","year":"2015","unstructured":"Park, S., Jin, Y., Song, H., Yoon, Y.: Designing a critical peak pricing scheme for the profit maximization objective considering price responsiveness of customers. Energy 83, 521\u2013531 (2015)","journal-title":"Energy"},{"key":"1_CR21","unstructured":"Ramchurn, S., Vytelingum, P., Rogers, A., Jennings, N.: Agent-based control for decentralised demand side management in the smart grid. In: AAMAS, pp. 5\u201312, February 2011"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.energy.2016.10.077","volume":"117","author":"V Robu","year":"2016","unstructured":"Robu, V., Chalkiadakis, G., Kota, R., Rogers, A., Jennings, N.R.: Rewarding cooperative virtual power plant formation using scoring rules. Energy 117, 19\u201328 (2016). https:\/\/doi.org\/10.1016\/j.energy.2016.10.077","journal-title":"Energy"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Shweta, J., Sujit, G.: A multiarmed bandit based incentive mechanism for a subset selection of customers for demand response in smart grids. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 2046\u20132053 (2020)","DOI":"10.1609\/aaai.v34i02.5577"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Xu, H., Liu, Y., Lau, W.C., Li, R.: Combinatorial multi-armed bandits with concave rewards and fairness constraints. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, pp. 2554\u20132560 (2020)","DOI":"10.24963\/ijcai.2020\/354"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Wang, X., Fu, M.: Optimal implementation strategies for critical peak pricing. In: 2009 6th International Conference on the European Energy Market, pp. 1\u20136. IEEE (2009)","DOI":"10.1109\/EEM.2009.5207139"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2021: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89188-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:35:00Z","timestamp":1725989700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89188-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030891879","9783030891886"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89188-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"382","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"93","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}