BibTeX record conf/sagt/EickmeyerHV12

• > Home > conf/sagt/EickmeyerHV12

@inproceedings{DBLP:conf/sagt/EickmeyerHV12,
  author       = {Kord Eickmeyer and
                  Kristoffer Arnsfelt Hansen and
                  Elad Verbin},
  editor       = {Maria J. Serna},
  title        = {Approximating the Minmax Value of Three-Player Games within a Constant
                  is as Hard as Detecting Planted Cliques},
  booktitle    = {Algorithmic Game Theory - 5th International Symposium, {SAGT} 2012,
                  Barcelona, Spain, October 22-23, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7615},
  pages        = {96--107},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-33996-7\_9},
  doi          = {10.1007/978-3-642-33996-7\_9},
  timestamp    = {Sun, 25 Oct 2020 23:05:07 +0100},
  biburl       = {https://dblp.org/rec/conf/sagt/EickmeyerHV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}