Pages that link to "Item:Q2817668"
From MaRDI portal
The following pages link to Simple strategies for large zero-sum games with applications to complexity theory (Q2817668):
Displaying 27 items.
- On incremental approximate saddle-point computation in zero-sum matrix games (Q286267) (← links)
- On the hardness of network design for bottleneck routing games (Q389953) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- Randomized sampling for large zero-sum games (Q490542) (← links)
- Arthur and Merlin as oracles (Q649095) (← links)
- A note on approximate Nash equilibria (Q1014628) (← links)
- On the complexity of succinct zero-sum games (Q1024660) (← links)
- On the NP-completeness of finding an optimal strategy in games with common payoffs (Q1414388) (← links)
- A note on the complexity of determining optimal strategies in games with common payoffs (Q1416783) (← links)
- The query complexity of correlated equilibria (Q1651292) (← links)
- Computing sparse approximations deterministically (Q1915603) (← links)
- A sublinear-time randomized approximation algorithm for matrix games (Q1919166) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- The distribution of optimal strategies in symmetric zero-sum games (Q2013377) (← links)
- Simple complexity from imitation games (Q2268119) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- Patience of matrix games (Q2444536) (← links)
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Arthur and Merlin as Oracles (Q3599130) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5028364) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- A remark on pseudo proof systems and hard instances of the satisfiability problem (Q5109236) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)
- Constructive separations and their consequences (Q6566463) (← links)
- Localizability of the approximation method (Q6624428) (← links)
- A probabilistic approach to the game of guessing in a random environment (Q6648343) (← links)
