{
  "annotation_id": "2ced3f5e-6af9-40c7-9ec5-a7c1732fe201",
  "date_created": "2026-03-02T18:01:53.045000Z",
  "date_modified": "2026-03-02T18:01:53.045000Z",
  "file_hash": "6638056a4845537feba966c542984261f7fac33f76921d8b7c7c5e6f4c0bde5d",
  "private": false,
  "record": {
    "abstract": "We pursue a general theory of quantum games. We show that quantum games are\nmore efficient than classical games, and provide a saturated upper bound for\nthis efficiency. We demonstrate that the set of finite classical games is a\nstrict subset of the set of finite quantum games. We also deduce the quantum\nversion of the Minimax Theorem and the Nash Equilibrium Theorem.",
    "arxiv_id": "quant-ph/0207012",
    "authors": [
      "Chiu Fan Lee",
      "Neil Johnson"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.67.022311",
    "journal_ref": "Phys. Rev. A 67, 022311 (2003)",
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Efficiency and formalism of quantum games",
    "url": "https://arxiv.org/abs/quant-ph/0207012"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "1c22ef2d-05f7-4abd-a685-2beb4f824a24",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}