@article{DBLP:journals/dc/BiloFMM21,
	author = {Vittorio Bil{\`{o}} and Michele Flammini and Gianpiero Monaco and Luca Moscardelli},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/journals/dc/BiloFMM21.bib},
	date-added = {2021-09-08 10:39:33 +0200},
	date-modified = {2021-09-08 10:39:33 +0200},
	doi = {10.1007/s00446-020-00381-4},
	journal = {Distributed Comput.},
	number = {1},
	pages = {1--14},
	timestamp = {Thu, 11 Feb 2021 11:53:38 +0100},
	title = {Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions},
	url = {https://doi.org/10.1007/s00446-020-00381-4},
	volume = {34},
	year = {2021},
	Bdsk-Url-1 = {https://doi.org/10.1007/s00446-020-00381-4}}

{"_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":[]}],"bibsource":"dblp computer science bibliography, https://dblp.org","biburl":"https://dblp.org/rec/journals/dc/BiloFMM21.bib","date-added":"2021-09-08 10:39:33 +0200","date-modified":"2021-09-08 10:39:33 +0200","doi":"10.1007/s00446-020-00381-4","journal":"Distributed Comput.","number":"1","pages":"1–14","timestamp":"Thu, 11 Feb 2021 11:53:38 +0100","title":"Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions","url":"https://doi.org/10.1007/s00446-020-00381-4","volume":"34","year":"2021","bdsk-url-1":"https://doi.org/10.1007/s00446-020-00381-4","bibtex":"@article{DBLP:journals/dc/BiloFMM21,\n\tauthor = {Vittorio Bil{\\`{o}} and Michele Flammini and Gianpiero Monaco and Luca Moscardelli},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/dc/BiloFMM21.bib},\n\tdate-added = {2021-09-08 10:39:33 +0200},\n\tdate-modified = {2021-09-08 10:39:33 +0200},\n\tdoi = {10.1007/s00446-020-00381-4},\n\tjournal = {Distributed Comput.},\n\tnumber = {1},\n\tpages = {1--14},\n\ttimestamp = {Thu, 11 Feb 2021 11:53:38 +0100},\n\ttitle = {Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions},\n\turl = {https://doi.org/10.1007/s00446-020-00381-4},\n\tvolume = {34},\n\tyear = {2021},\n\tBdsk-Url-1 = {https://doi.org/10.1007/s00446-020-00381-4}}\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://253909021-atari-embeds.googleusercontent.com/embeds/16cb204cf3a9d4d223a0a3fd8b0eec5d/inner-frame-minified.html"}},"downloads":0},"bibtype":"article","biburl":"https://drive.google.com/uc?export=download&id=19WpQhoMIwJIL1DMqKywl2YoH2M7MIki5","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"]}