{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T03:18:12Z","timestamp":1791083892913,"version":"4.1.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1608361"],"award-info":[{"award-number":["ECCS-1608361"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2020,4,1]]},"DOI":"10.1109\/tnse.2019.2923959","type":"journal-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T21:37:17Z","timestamp":1561066637000},"page":"621-636","source":"Crossref","is-referenced-by-count":34,"title":["Distributed Mechanism Design for Network Resource Allocation Problems"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8097-9885","authenticated-orcid":false,"given":"Nasimeh","family":"Heydaribeni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3795-1654","authenticated-orcid":false,"given":"Achilleas","family":"Anastasopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798915"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2016.7525222"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1754"},{"key":"ref32","article-title":"Mechanism design with allocative, informational and learning constraints","author":"sinha","year":"2017"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8264399"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7249227"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2684464.2684480"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481"},{"key":"ref35","article-title":"Distributed algorithmic mechanism design","author":"sami","year":"2003"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/570810.570812"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2010.05.013"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2541298"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130717"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2337431"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2680319"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-006-5192-y"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2008.929552"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/DYSPAN.2010.5457905"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67540-4_6"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2007.895676"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2012.121203"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19072-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511754258"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/2400000002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139565844"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/1912672"},{"key":"ref29","author":"dantzig","year":"2016","journal-title":"Linear Programming and Extensions"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199734023.001.0001"},{"key":"ref8","article-title":"Revenue and stability of a mechanism for efficient allocation of a divisible good","author":"yang","year":"2005"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2307\/2297046"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8618979"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2004.1430264"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2018.8503187"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/59.898098"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.3982\/TE898"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2012.2203341"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SMARTGRID.2010.5622073"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvcm4gh1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(76)90003-1"},{"key":"ref41","first-page":"253","article-title":"Graphical models for game theory","author":"kearns","year":"0","journal-title":"Proc 17th Conf Uncertainty Artif Intell"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.3.399"},{"key":"ref44","volume":"1","author":"mas-colell","year":"1995","journal-title":"Microeconomic Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2923959"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","article-title":"On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators","volume":"55","author":"eckstein","year":"1992","journal-title":"Math Program"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6488902\/9108636\/8742653-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/9108636\/08742653.pdf?arnumber=8742653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:24:46Z","timestamp":1651080286000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8742653\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,1]]},"references-count":45,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2019.2923959","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,1]]}}}