{"paper":{"title":"Simple approximate equilibria in games with many players","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Itai Arieli, Yakov Babichenko","submitted_at":"2017-01-27T06:47:02Z","abstract_excerpt":"We consider $\\epsilon$-equilibria notions for constant value of $\\epsilon$ in $n$-player $m$-actions games where $m$ is a constant. We focus on the following question: What is the largest grid size over the mixed strategies such that $\\epsilon$-equilibrium is guaranteed to exist over this grid.\n  For Nash equilibrium, we prove that constant grid size (that depends on $\\epsilon$ and $m$, but not on $n$) is sufficient to guarantee existence of weak approximate equilibrium. This result implies a polynomial (in the input) algorithm for weak approximate equilibrium.\n  For approximate Nash equilibri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07956","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}