Smoothed Efficient Algorithms and Reductions for Network Coordination Games

Shant Boodaghians, Rucha Kulkarni, Ruta Mehta. Smoothed Efficient Algorithms and Reductions for Network Coordination Games. In Thomas Vidick, editor, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA. Volume 151 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

@inproceedings{BoodaghiansKM20,
  title = {Smoothed Efficient Algorithms and Reductions for Network Coordination Games},
  author = {Shant Boodaghians and Rucha Kulkarni and Ruta Mehta},
  year = {2020},
  doi = {10.4230/LIPIcs.ITCS.2020.73},
  url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.73},
  researchr = {https://researchr.org/publication/BoodaghiansKM20},
  cites = {0},
  citedby = {0},
  booktitle = {11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA},
  editor = {Thomas Vidick},
  volume = {151},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-134-4},
}