@inproceedings{DBLP:conf/wine/BiloFMM15,
  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},
  booktitle    = {Web and Internet Economics - 11th International Conference, {WINE}
                  2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},
  pages        = {118--131},
  year         = {2015},
  crossref     = {DBLP:conf/wine/2015},
  url          = {https://doi.org/10.1007/978-3-662-48995-6\_9},
  doi          = {10.1007/978-3-662-48995-6\_9},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/BiloFMM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"byeLEaBkmfTha2Rhx","bibbaseid":"bil-flammini-monaco-moscardelli-computingapproximatenashequilibriainnetworkcongestiongameswithpolynomiallydecreasingcostfunctions-2015","authorIDs":["5e179d8bd954d8df010000c3","5e55a3d07d0846de01000021","5e62a35908ebcade010000dc","5e62bb28cb259cde01000086","8meaCaGvLTwZmThxM","Ckr6voburrugPYoN3","DZK26mGsFJvSxD7ag","F3DqCxe76qrNziM6R","tFNbQAB3HiEmPSsXk"],"author_short":["Bilò, V.","Flammini, M.","Monaco, G.","Moscardelli, L."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","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","booktitle":"Web and Internet Economics - 11th International Conference, WINE 2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings","pages":"118–131","year":"2015","crossref":"DBLP:conf/wine/2015","url":"https://doi.org/10.1007/978-3-662-48995-6\\_9","doi":"10.1007/978-3-662-48995-6_9","timestamp":"Thu, 14 Oct 2021 01:00:00 +0200","biburl":"https://dblp.org/rec/conf/wine/BiloFMM15.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/wine/BiloFMM15,\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 booktitle = {Web and Internet Economics - 11th International Conference, {WINE}\n 2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},\n pages = {118--131},\n year = {2015},\n crossref = {DBLP:conf/wine/2015},\n url = {https://doi.org/10.1007/978-3-662-48995-6\\_9},\n doi = {10.1007/978-3-662-48995-6\\_9},\n timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/wine/BiloFMM15.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:conf/wine/BiloFMM15","id":"DBLP:conf/wine/BiloFMM15","bibbaseid":"bil-flammini-monaco-moscardelli-computingapproximatenashequilibriainnetworkcongestiongameswithpolynomiallydecreasingcostfunctions-2015","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-662-48995-6\\_9"},"metadata":{"authorlinks":{"flammini, m":"https://95395825-atari-embeds.googleusercontent.com/embeds/16cb204cf3a9d4d223a0a3fd8b0eec5d/inner-frame-minified.html"}},"downloads":0},"bibtype":"inproceedings","biburl":"https://dblp.uni-trier.de/pers/tb2/f/Flammini:Michele.bib","creationDate":"2019-10-09T10:36:41.827Z","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":2015,"dataSources":["RKZzE9qbnqyegdbZi","Apmxrn2k8d9m58buk","kCt8NvHdC72dHkmfu"]}