EconStor
metadata only
A Polynomial-Time Strict-Sub-One-Third Approximation Theorem for Bimatrix Games
This paper establishes a strict deterministic polynomial-time approximation guarantee below the one-third frontier for general two-player rational bimatrix games with payoffs normalized to the unit interval. The result addresses the long-standing upper-bound question of whether the universal worst-c
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Equilibrium Numbers in Non-Square Bimatrix Games#1051276
- Standard Quadratic Formulations of Many NP Problems: A Simplex-Based Compilation Framework for Combinatorial Optimization#1157182
- Finding a Positive Index Nash Equilibrium is PPADS-Complete#1050070
- A Stable-Set Bound and Maximal Numbers of Nash Equilibria in Bimatrix Games#1050734
- Systematic Data Structure Lower Bounds via the Query-with-Sketch Model#1011731
Record · ID 1119836
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive