Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions. Bilò, V., Flammini, M., Monaco, G., & Moscardelli, L. Distributed Comput., 34(1):1–14, 2021. Paper doi bibtex @article{DBLP:journals/dc/BiloFMM21,
author = {Vittorio Bil{\`{o}} and
Michele Flammini and
Gianpiero Monaco and
Luca Moscardelli},
title = {Computing approximate Nash equilibria in network congestion games
with polynomially decreasing cost functions},
journal = {Distributed Comput.},
volume = {34},
number = {1},
pages = {1--14},
year = {2021},
url = {https://doi.org/10.1007/s00446-020-00381-4},
doi = {10.1007/S00446-020-00381-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/BiloFMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"fT4PeYLfM49Khfau3","bibbaseid":"bil-flammini-monaco-moscardelli-computingapproximatenashequilibriainnetworkcongestiongameswithpolynomiallydecreasingcostfunctions-2021","authorIDs":["F3DqCxe76qrNziM6R"],"author_short":["Bilò, V.","Flammini, M.","Monaco, G.","Moscardelli, L."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Vittorio"],"propositions":[],"lastnames":["Bilò"],"suffixes":[]},{"firstnames":["Michele"],"propositions":[],"lastnames":["Flammini"],"suffixes":[]},{"firstnames":["Gianpiero"],"propositions":[],"lastnames":["Monaco"],"suffixes":[]},{"firstnames":["Luca"],"propositions":[],"lastnames":["Moscardelli"],"suffixes":[]}],"title":"Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions","journal":"Distributed Comput.","volume":"34","number":"1","pages":"1–14","year":"2021","url":"https://doi.org/10.1007/s00446-020-00381-4","doi":"10.1007/S00446-020-00381-4","timestamp":"Thu, 11 Feb 2021 00:00:00 +0100","biburl":"https://dblp.org/rec/journals/dc/BiloFMM21.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/dc/BiloFMM21,\n author = {Vittorio Bil{\\`{o}} and\n Michele Flammini and\n Gianpiero Monaco and\n Luca Moscardelli},\n title = {Computing approximate Nash equilibria in network congestion games\n with polynomially decreasing cost functions},\n journal = {Distributed Comput.},\n volume = {34},\n number = {1},\n pages = {1--14},\n year = {2021},\n url = {https://doi.org/10.1007/s00446-020-00381-4},\n doi = {10.1007/S00446-020-00381-4},\n timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/dc/BiloFMM21.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Bilò, V.","Flammini, M.","Monaco, G.","Moscardelli, L."],"key":"DBLP:journals/dc/BiloFMM21","id":"DBLP:journals/dc/BiloFMM21","bibbaseid":"bil-flammini-monaco-moscardelli-computingapproximatenashequilibriainnetworkcongestiongameswithpolynomiallydecreasingcostfunctions-2021","role":"author","urls":{"Paper":"https://doi.org/10.1007/s00446-020-00381-4"},"metadata":{"authorlinks":{"flammini, m":"https://1041479396-atari-embeds.googleusercontent.com/embeds/16cb204cf3a9d4d223a0a3fd8b0eec5d/inner-frame-minified.html"}},"downloads":0},"bibtype":"article","biburl":"https://dblp.uni-trier.de/pers/tb2/f/Flammini:Michele.bib","creationDate":"2021-02-17T10:27:04.061Z","downloads":0,"keywords":[],"search_terms":["computing","approximate","nash","equilibria","network","congestion","games","polynomially","decreasing","cost","functions","bilò","flammini","monaco","moscardelli"],"title":"Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions","year":2021,"dataSources":["Apmxrn2k8d9m58buk","RKZzE9qbnqyegdbZi","kCt8NvHdC72dHkmfu"]}