---
res:
  bibo_abstract:
  - We introduce a graph Ramsey game called Ramsey, Paper,Scissors. This game has
    two players, Proposer and Decider.Starting from an empty graph on n vertices,
    on each turnProposer proposes a potential edge and Decider simultane-ously decides
    (without knowing Proposer’s choice) whether toadd it to the graph. Proposer cannot
    propose an edge whichwould create a triangle in the graph. The game ends whenProposer
    has no legal moves remaining, and Proposer wins ifthe final graph has independence
    number at least s. We provea threshold phenomenon exists for this game by exhibitingrandomized
    strategies for both players that are optimal up toconstants. Namely, there exist
    constants 0 < A < B such that(under optimal play) Proposer wins with high probability
    ifs < A√n log n, while Decider wins with high probability ifs > B√n log n. This
    is a factor of Θ(√log n)) larger than thelower bound coming from the off-diagonal
    Ramsey numberr(3, s).@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Jacob
      foaf_name: Fox, Jacob
      foaf_surname: Fox
  - foaf_Person:
      foaf_givenName: Xiaoyu
      foaf_name: He, Xiaoyu
      foaf_surname: He
  - foaf_Person:
      foaf_givenName: Yuval
      foaf_name: Wigderson, Yuval
      foaf_surname: Wigderson
      foaf_workInfoHomepage: http://www.librecat.org/personId=2d0023a0-1567-11f0-833d-d5c1e476d4b5
  bibo_doi: 10.1002/rsa.20950
  bibo_issue: '4'
  bibo_volume: 57
  dct_date: 2020^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1042-9832
  - http://id.crossref.org/issn/1098-2418
  dct_language: eng
  dct_publisher: Wiley@
  dct_title: Ramsey, Paper, Scissors@
...