Pages that link to "Item:Q4554071"
From MaRDI portal
The following pages link to Constant Rank Two-Player Games are PPAD-hard (Q4554071):
Displaying 6 items.
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- On the Complexity of Equilibrium Computation in First-Price Auctions (Q5885597) (← links)
- Consensus-Halving: Does It Ever Get Easier? (Q5890032) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls (Q6567266) (← links)
