{
  "annotation_id": "7f495b95-40f4-4db7-ab77-4b92a6581538",
  "date_created": "2026-03-02T18:02:06.144000Z",
  "date_modified": "2026-03-02T18:02:06.144000Z",
  "file_hash": "487365e641f96b7f884fddcda5bf9334674ea01c6ce0f243ea6e1a1f2d80fb99",
  "private": false,
  "record": {
    "abstract": "We consider a coalitional game with the same payoff for all players. To\nmaximize the payoff, the players need to use one collective strategy, if all\nplayers are in certain states, and the other strategy otherwise. The current\nstate of each player changes according to external conditions and is not known\nto the other players. In one example of such a game, quantum entanglement\nbetween players results in the optimal payoff thrice the maximal payoff for\nunentangled players.",
    "arxiv_id": "quant-ph/0405093",
    "authors": [
      "Gleb V. Klimovitch"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "How Quantum Entanglement Helps to Coordinate Non-Communicating Players",
    "url": "https://arxiv.org/abs/quant-ph/0405093"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e5156dc8-db34-4811-9f11-005adf678083",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}