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.
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions [link]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