Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
Constant rank two-player games are PPAD-hard
Ruta Mehta
Siebel School of Computing and Data Science
Coordinated Science Lab
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Constant rank two-player games are PPAD-hard'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Rank Two
100%
Two-player Games
100%
Constant Rank
100%
Nash Equilibrium
75%
Nash Equilibrium Computation
75%
Zero-sum Game
50%
FPTAS
50%
Two Dimensional
25%
Polynomial-time Algorithm
25%
Theoretical Computer Science
25%
Simple Proof
25%
Gadgets
25%
Zero-sum
25%
Convex Set
25%
Theory of Computing
25%
Piecewise Linear Function
25%
Symmetric Nash Equilibrium
25%
Payoff Matrix
25%
Mathematical Economics
25%
Rank-1 Game
25%
Graphical Games
25%
Simple Stochastic Games
25%
Approximate Fixed Point
25%
PPAD-hardness
25%
PPAD-complete
25%
Normal Form Games
25%
Mathematics
Nash Equilibrium
100%
Fully Polynomial-Time Approximation Scheme
28%
Polynomial Time
14%
Open Problem
14%
Convex Set
14%
Linear Function
14%
Stochastic Game
14%
Payoff Matrix
14%
Approximate Fixed Point
14%
Mathematical Economics
14%
Piecewise Linear
14%
Computer Science
Nash Equilibrium
100%
Fully Polynomial-Time Approximation Scheme
28%
Fixed Points
14%
Polynomial Time Algorithm
14%
piecewise linear
14%
Theoretical Computer Science
14%
Normal Form Game
14%
Linear Function
14%
Economics, Econometrics and Finance
Nash Equilibrium
100%
Stochastic Game
14%
Business Mathematics
14%
Normal-Form Game
14%