On the Complexity of Nash Equilibria and Other Fixed Points¶
Etessami, K. (2010). On the Complexity of Nash Equilibria and Other Fixed Points. SIAM Journal on Computing, 39(6), 2531-2597.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Fixed-point computation
- Etessami and Yannakakis define these as different computational questions in their fixed-point framework.
This sourceFull original author manuscript directly inspected; manuscript §2.1 p.7 defines encoded search problems, §2.3 pp.11–12 gives Nash and exchange maps and the reduction boundary, p.15 distinguishes strong and weak approximations, Theorem 18 pp.40–41 bounds the Nash result, and Proposition 19 pp.45–46 bounds the exchange result. Manuscript printed pages and PDF page indexes differ by one. The publisher article record confirms journal metadata; its abstract alone is not the basis for the detailed claims.
- Etessami and Yannakakis define these as different computational questions in their fixed-point framework.
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:f78d1c518983 · see in the full table