{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:37Z","timestamp":1750306537512,"version":"3.41.0"},"reference-count":1,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T00:00:00Z","timestamp":1417996800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2014,12,8]]},"abstract":"<jats:p>\n            Motivation.The increasing mobile data demand and the proliferation of advanced user-owned network equipment have given rise to collaborative schemes, where users satisfy each other's communication needs whenever they have spare network resources [2]. A prerequisite for the success of these models is to ensure that users will share their resources in a fair fashion, and hence will agree to cooperate. Ideally, from a system design point of view, each user should receive resources (or, service) commensurate to his contribution. When this is not possible, e.g., due to asymmetries in resource availability, we would prefer to have a\n            <jats:italic>lexicographically optimal<\/jats:italic>\n            (or, lex-optimal) outcome that balances the resource exchanges as much as possible. Nevertheless, achieving such an allocation is an intricate task since: (i) the service exchange is constrained by an underlying graph that prescribes, for each node, the subset of the nodes he can serve and receive services from, (ii) each user takes servicing decisions independently whenever he has idle network resources, aiming to maximize the total service he receives in exchange, (iii) each user is not aware of the resource availability of other users, nor he is aware of their current service allocation decisions (towards the other nodes). In this totally dynamic, fully decentralized and graph-constrained market setting, the following question arises:\n            <jats:italic>how the lex-optimal allocation can be achieved in an asynchronous fashion by the users?<\/jats:italic>\n            ..\n          <\/jats:p>","DOI":"10.1145\/2695533.2695548","type":"journal-article","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T16:17:14Z","timestamp":1418055434000},"page":"40-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Exchange of Communication Services"],"prefix":"10.1145","volume":"42","author":[{"given":"Leonidas","family":"Georgiadis","sequence":"first","affiliation":[{"name":"Aristotle University of Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Iosifidis","sequence":"additional","affiliation":[{"name":"University of Thessaly, and CERTH, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leandros","family":"Tassiulas","sequence":"additional","affiliation":[{"name":"University of Thessaly, and CERTH, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,12,8]]},"reference":[{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2008.4689212"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2695533.2695548","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2695533.2695548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:21Z","timestamp":1750227141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2695533.2695548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,8]]},"references-count":1,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,12,8]]}},"alternative-id":["10.1145\/2695533.2695548"],"URL":"https:\/\/doi.org\/10.1145\/2695533.2695548","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2014,12,8]]},"assertion":[{"value":"2014-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}