{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:39:57Z","timestamp":1730230797007,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/icassp40776.2020.9054699","type":"proceedings-article","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T20:21:13Z","timestamp":1586463673000},"page":"8733-8737","source":"Crossref","is-referenced-by-count":2,"title":["Robust Pricing Mechanism for Resource Sustainability Under Privacy Constraint in Competitive Online Learning Multi-Agent Systems"],"prefix":"10.1109","author":[{"given":"Ezra","family":"Tampubolon","sequence":"first","affiliation":[]},{"given":"Holger","family":"Boche","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Pricing mechanism for resource sustainability in competitive online learning multi-agent systems","year":"2019","author":"tampubolon","key":"ref30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0149-x"},{"article-title":"Robust online learning for resource allocation - beyond euclidean projection and dynamic fit","year":"2019","author":"tampubolon","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9052961"},{"key":"ref13","first-page":"928","article-title":"Online Convex Programming and Generalized Infinitesimal Gradient Ascent","author":"zinkevich","year":"2003","journal-title":"Proceedings of the 20th International Conference on International Conference on Machine Learning"},{"key":"ref14","first-page":"83","author":"scutari","year":"2012","journal-title":"Monotone Games for Cognitive Radio Syst"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2010.2089069"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2186410"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2013.2287494"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2015.2432057"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2016.01.035"},{"key":"ref28","article-title":"Nash and Wardrop Equilibria in Aggregative Games with Coupling Constraints","author":"paccagnan","year":"2017","journal-title":"IEEE Trans on Aut Cont"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MVT.2018.2811185"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2019.8815563"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110406"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"journal-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","year":"2003","author":"facchinei","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1201\/b19011"},{"article-title":"Online convex optimization and no-regret learning: Algorithms, guarantees and applications","year":"2018","author":"belmega","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2544600"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2860281"},{"key":"ref9","first-page":"1265","article-title":"Convex repeated games and Fenchel duality","volume":"19","author":"shalev-shwartz","year":"2007","journal-title":"Advances in neural information processing systems"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2348197"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2463121"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2873344"},{"key":"ref24","article-title":"Learning in games with continuous action sets and unknown payoff functions","author":"mertikopoulos","year":"2018","journal-title":"Math Prog"},{"article-title":"Robust deanonymization of large datasets (how to break anonymity of the net-flix prize dataset)","year":"2006","author":"narayan","key":"ref23"},{"article-title":"Multi-agent online learning with imperfect information","year":"2018","author":"zhou","key":"ref26"},{"key":"ref25","article-title":"Learning in time-varying games","author":"duvocelle","year":"2018","journal-title":"CoRR"}],"event":{"name":"ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2020,5,4]]},"location":"Barcelona, Spain","end":{"date-parts":[[2020,5,8]]}},"container-title":["ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9040208\/9052899\/09054699.pdf?arnumber=9054699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:07:17Z","timestamp":1656374837000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9054699\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/icassp40776.2020.9054699","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}