No article text was recorded for this version.
sparse equilibrium support
Version 2 of 273 papers95 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Sparse binary zero-sum games
- Blog: On the Approximation of Nash Equilibria in Sparse Win-Lose Games
- Blog: Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games
- Blog: Computing Equilibria with Two-Player Zero-Sum Continuous Stochastic Games with Switching Controller
- Blog: Separable and Low-Rank Continuous Games
- Blog: Empirical Distribution of Equilibrium Play and Its Testing Application
- Blog: Separable and Low-Rank Continuous Games
- Blog: Lipschitz Continuity and Approximate Equilibria
- Blog: Mixed Strategies for Security Games with General Defending Requirements
- Blog: Query-Efficient Algorithms to Find the Unique Nash Equilibrium in a Two-Player Zero-Sum Matrix Game
- Blog: Two-Player Zero-Sum Differential Games with One-Sided Information
- Blog: On oblivious PTAS's for nash equilibrium
- Blog: Online Double Oracle
- Blog: Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback
- Blog: Sparse Binary Zero-Sum Games
- Blog: Online Sparse Bandit for Card Games
- Blog: Online Double Oracle
- Blog: Polynomial-Time Computation of Exact $\Phi$-Equilibria in Polyhedral Games
- Blog: Sharing Information in Adversarial Bandit
- Blog: DO-GAN: A Double Oracle Framework for Generative Adversarial Networks
- Blog: On the Existence of Low-Rank Explanations for Mixed Strategy Behavior
- Blog: Fairness in Multi-Agent Sequential Decision-Making
- Blog: Nash Equilibria in Perturbation Resilient Games
- Blog: Portfolio Methods in Uncertain Contexts
- Blog: Regret-Minimizing Double Oracle for Extensive-Form Games
- Blog: Computational Game Theory for Security and Sustainability
- Blog: Playing Anonymous Games using Simple Strategies
- Blog: Computational Lower Bounds for Regret Minimization in Normal-Form Games
- Blog: Fast Equilibrium Computation for Infinitely Repeated Games
- Blog: Learning Sparse Polymatrix Games in Polynomial Time and Sample Complexity
- Blog: Approximate Nash Equilibria with Near Optimal Social Welfare
- Blog: Small Nash Equilibrium Certificates in Very Large Games
- Blog: Contextual Dueling Bandits
- Blog: Estimating α-Rank from A Few Entries with Low Rank Matrix Completion
- Blog: Algorithms for Closed Under Rational Behavior (CURB) Sets
- Blog: New Sequence-Independent Lifting Techniques for Cover Inequalities and When They Induce Facets
- Blog: Logarithmic Query Complexity for Approximate Nash Computation in Large Games
- Blog: A Polynomial Time Algorithm for Spatio-Temporal Security Games
- Blog: Sample compression schemes for VC classes
- Blog: Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem
- Blog: Approximate Well-supported Nash Equilibria below Two-thirds
- Blog: A Regression Approach for Modeling Games With Many Symmetric Players
- Blog: GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms
- Blog: Layered Graph Security Games
- Blog: Private and Third-Party Randomization in Risk-Sensitive Equilibrium Concepts
- Blog: Simple Search Methods for Finding a Nash Equilibrium
- Blog: A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios
- Blog: Regularized Gradient Descent Ascent for Two-Player Zero-Sum Markov Games
- Blog: Empirical Distribution of Equilibrium Play and Its Testing Application
- Blog: AI safety by debate via regret minimization
- Blog: Mixed Strategies for Security Games with General Defending Requirements
- Blog: Small Nash Equilibrium Certificates in Very Large Games
- Blog: DAG-Based Column Generation for Adversarial Team Games
- Blog: Commitment to Sparse Strategies in Two-Player Games
- Blog: Commitment to Sparse Strategies in Two-Player Games
- Blog: Security Game with Non-additive Utilities and Multiple Attacker Resources
- Blog: Turbocharging Solution Concepts: Solving NEs, CEs and CCEs with Neural Equilibrium Solvers
- Blog: Estimating α-Rank by Maximizing Information Gain
- Blog: An Efficient, Exact Algorithm for Solving Tree-Structured Graphical Games
- Blog: Instance-dependent Regret Bounds for Dueling Bandits
Showing 60 of 73 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_sparse_equilibrium_support_b866fd88,
title = {sparse equilibrium support},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sparse-equilibrium-support/rdr_b866fd88b43644eda086c6809b309dad},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 2, frozen text):
@misc{lacuna_sparse_equilibrium_support_b866fd88_v2,
title = {sparse equilibrium support},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sparse-equilibrium-support/rdr_b866fd88b43644eda086c6809b309dad/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-22},
}